Combinatorial Optimization

Title page......Page 1
Contents......Page 3
Preface......Page 5
1 Branch and Bound Methods for Integer Programming, R.S. Garfinkel......Page 7
2 The Theory of Cutting-Planes, R. Jeroslow......Page 27
3 Subgradient Optimization, C. Sandi......Page 79
4 A Partial Order in the Solution Space of Bivalent Programs, P.L. Hammer and S. Nguyen......Page 100
5 The Complexity of Combinatorial Optimization Algorithms and the Challenge of Heuristics, F. Maffioli......Page 113
6 The Travelling Salesman Problem, N. Christofides......Page 137
7 Set Partitioning-A Survey, E. Balas and M.W. Padberg......Page 157
8 The Graph-Colouring Problem, S. M. Korman......Page 217
9 The 0-1 Knapsack Problem, S. Martello and P. Toth......Page 243
10 Complexity and Efficiency in Minimax Network Location, G. Y. Handler......Page 287
11 The Vehicle Routing Problem, N. Christofides, A. Mingozzi, and P. Toth......Page 321
12 Loading Problems, N. Christofides, A. Mingozzi, and P. Toth......Page 345
13 Minimizing Maximum Lateness on One Machine: Algorithms and Applications, B. Lageweg, J.K. Lenstra, and A.H.G. Rinnooy Kan......Page 377
14 The Crew Scheduling Problem: A Travelling Salesman Approach, F. Giannessi and B. Nicoletti......Page 395
15 Graph Theoretic Approaches to Foreign Exchange Operations, N. Christofides, R.D. Hewins, and G.R. Salkin......Page 415
Index......Page 427