## Combinatorial programming, spatial analysis and planning |

### From inside the book

28 pages matching **objective function value** in this book

Where's the rest of this book?

Results 1-3 of 28

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Exact methods of solving combinatorial programming | 7 |

A branch and bound algorithm | 15 |

A backtrack programming algorithm | 22 |

Copyright | |

9 other sections not shown

### Common terms and phrases

addition aggregate analysis backtrack programming basic Bellman binary bound algorithm branch and bound central facilities centre centroid Chapter combinatorial problems combinatorial programming problems combinatorial tree computational considered constraints construction dantzig defined discrete dynamic programming distance elements evaluated example feasible solution flow given problem gomory hamiltonian circuit heuristic algorithm heuristic programming identified infeasible integer linear programming integer programming iteration Journal large number linear programming location-allocation problem location-allocation systems 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 quadratic assignment problem represent Scott set of vertices shortest path shortest path problem 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 tour trans-shipment problem travelling salesman problem tree-searching methods vertex