What people are saying - Write a review
We haven't found any reviews in the usual places.
Exact methods of solving combinatorial programming
Heuristic methods of solving combinatorial
Basic elements of spatiallystructured combinatorial
6 other sections not shown
Other editions - View all
addition aggregate analysis backtrack programming basic BELLMAN binary bound algorithm branch and bound central facilities centre centroid Chapter combinatorial problems combinatorial tree computational considered constraints construction Dantzig defined diſ discrete dynamic programming distance elements evaluated example feasible solution flow given problem Gomory graph hamiltonian circuit heuristic algorithm heuristic programming identified infeasible integer programming iteration journal kth shortest path large number linear programming location problem location-allocation problem minimal spanning tree minimum objective function value operating costs Operations Research optimal network problem optimal solution pair of vertices particular partitioning problems planning possible procedures programming algorithm quadratic assignment problem Regional Science represent set of vertices shortest path shown in Figure simple solution process solution sequence solution space solving spatial specified Steiner minimal tree Steiner point strategy structure sub-problem subroutine Suppose Table theorem time-path time-period tion topology total number trans-shipment problem travelling salesman problem tree-searching methods vertex