| Preface | p. xi |
| Linear and Integer Programming | p. 1 |
| Linear Programming | p. 2 |
| Construction of the Revised Simplex Method | p. 3 |
| Numerical Stability | p. 18 |
| Large LP Problems | p. 21 |
| Convergence and Time Complexity | p. 21 |
| A Polynomial-Time Algorithm | p. 23 |
| Problems Equivalent to Linear Programming | p. 26 |
| Problems | p. 28 |
| References and Remarks | p. 35 |
| Dual Linear Programming Method | p. 37 |
| Problems | p. 50 |
| References and Remarks | p. 53 |
| Transportation Problem | p. 54 |
| Maximum Flow in a Network | p. 56 |
| Maximum Flow Solution Method of the Transportation Problem | p. 60 |
| Problems | p. 71 |
| References and Remarks | p. 76 |
| Integer Programming | p. 77 |
| Algorithms for Integer Programming | p. 80 |
| Construction of the Gomory All-Integer Dual Method | p. 82 |
| Gomory's All-Integer Dual Algorithm | p. 86 |
| Problems | p. 96 |
| References and Remarks | p. 99 |
| Zero-One Integer Programming | p. 100 |
| Implicit Enumeration | p. 102 |
| The Balas Zero-One Additive Algorithm | p. 104 |
| Problems | p. 114 |
| References and Remarks | p. 115 |
| Packing and Covering | p. 117 |
| The Knapsack Problem | p. 118 |
| Problem Formulations and Applications | p. 118 |
| Lower and Upper Bounds | p. 123 |
| Reduction Algorithm | p. 126 |
| Approximation Algorithms | p. 135 |
| Exact Methods | p. 142 |
| Computational Results | p. 162 |
| Problems | p. 165 |
| References and Remarks | p. 171 |
| Covering Problems | p. 176 |
| Formulations and Applications | p. 176 |
| Reduction Algorithms | p. 179 |
| Implicit Enumeration Method for the Set-Partitioning Problem | p. 194 |
| Computational Results | p. 210 |
| Problems | p. 211 |
| References and Remarks | p. 217 |
| Optimization on Networks | p. 221 |
| Computer Representation of a Network | p. 223 |
| Paths and Trees | p. 226 |
| Shortest Path Problems | p. 227 |
| Single-Source Paths, Nonnegative Weights | p. 228 |
| Single-Source Paths, Arbitrary Weights | p. 235 |
| Shortest Paths between All Pairs of Nodes | p. 242 |
| Comparative Performances of Shortest-Path Algorithms | p. 246 |
| Problems | p. 247 |
| References and Remarks | p. 249 |
| Minimum Spanning Tree Problem | p. 253 |
| Kruskal's Algorithm | p. 253 |
| Prim's Algorithm | p. 259 |
| Comparative Performance of MST Algorithm | p. 264 |
| Problems | p. 265 |
| References and Remarks | p. 267 |
| Maximum Flow Problem | p. 269 |
| Problems | p. 296 |
| References and Remarks | p. 298 |
| Minimum-Cost Flow Problem | p. 301 |
| Problems | p. 314 |
| References and Remarks | p. 317 |
| Maximum-Cardinality Matching | p. 320 |
| Problems | p. 337 |
| References and Remarks | p. 340 |
| Traveling Salesman Problem | p. 343 |
| A Branch-and-Bound Algorithm | p. 346 |
| Approximate Algorithms | p. 361 |
| Local Search Heuristics | p. 368 |
| Modifications | p. 380 |
| Problems | p. 382 |
| References and Remarks | p. 386 |
| Coloring and Scheduling | p. 393 |
| Graph Coloring | p. 394 |
| Definitions and Basic Properties | p. 395 |
| Independent Set Approach | p. 399 |
| Approximate Sequential Algorithms | p. 404 |
| Backtracking Sequential Algorithm | p. 424 |
| Computational Results | p. 433 |
| Problems | p. 438 |
| References and Remarks | p. 442 |
| Scheduling Problems | p. 445 |
| Network Scheduling | p. 446 |
| Resource Constrained Network Scheduling | p. 454 |
| Flow Shop and Job Shop Scheduling | p. 474 |
| General Scheduling Problem | p. 484 |
| Single-Machine Scheduling | p. 489 |
| Parallel Machine Scheduling | p. 496 |
| Parallel Machine Scheduling with Precedence Constraints | p. 503 |
| Problems | p. 517 |
| References and Remarks | p. 527 |
| Index | p. 535 |
| Table of Contents provided by Ingram. All Rights Reserved. |
