Combinatorial Programming, Spatial Analysis and Planning |
Contents
Exact methods of solving combinatorial programming | 7 |
A branch and bound algorithm | 15 |
A backtrack programming algorithm | 22 |
Copyright | |
8 other sections not shown
Other editions - View all
Common terms and phrases
addition aggregate analysis arc linking backtrack programming basic BELLMAN binary bound algorithm branch and bound central facilities centre centroid combinatorial problems combinatorial tree considered constraints construction DANTZIG defined discrete dynamic programming distance elements feasible solution flow given problem GOMORY graph hamiltonian circuit heuristic algorithm heuristic programming identified infeasible integer linear programming integer programming iteration Journal kth shortest path large number location-allocation problem location-allocation systems Management Science minimal spanning tree Naval Research Logistics objective function value operating costs Operational Research Quarterly Operations Research optimal network problem optimal solution partitioning problems planning possible procedures programming algorithm quadratic assignment problem represent Research Logistics Quarterly set of vertices shortest path shown in Figure simple solution process solution space solving spatial specified Steiner minimal tree Steiner point strategy structure sub-problem Suppose Table theorem time-period tion topology total number trans-shipment problem transportation problem travelling salesman problem tree-searching methods