Contents:Front Cover; Integer Programming; Copyright Page; Contents; Preface; Chapter 1. Introduction to Integer Programming; 1 Presentation of the Problem; 2 Pilot Scheduling; 3 A Quadratic Assignment Problem; 4 The Knapsack Problem; 5 The Traveling Salesman Problem; 6 The Fixed-Charge Problem; 7 Nonlinear Approximation; 8 Dichotomies; Chapter 2. Linear Programming; 1 The General Linear Program; 2 Recognition of Optimality; 3 The Simplex Method; 4 Tableau Form; 5 The Inverse Matrix Method; 6 Variables with Upper Bounds; 7 The Lexicographic Dual Simplex Method; Chapter 3. All-Integer Methods
1 Optimality Theory for Integer Programming2 Improving a Nonoptimal Solution; 3 Equivalent Integer Programs; 4 Convergence to Optimality; 5 Bounded Variable Problems; 6 Negative cj Values; 7 The Use of Bounding Forms; 8 A Primal Integer Method; Chapter 4. Solving Integer Programs by Enumeration; 1 A Direct Enumeration Method; 2 Solution to the Integer Program; 3 An Accelerated Enumeration; 4 A Dynamic Programming Method; 5 Knapsack Functions; Chapter 5. Continuous Solution Methods; 1 A Continuous Solution Method; 2 Improving a Nonoptimal Solution; 3 Convergence in the Algorithm
4 Reducing the Continuous Solution to an All- Integer Format5 Bounding the Determinant Value; 6 Bounded Variable Problems; 7 The Mixed Integer Problem; Chapter 6. Number Theory Results; 1 The Euclidean Algorithm; 2 Linear Diophantine Equations; 3 Linear Congruences; 4 The Solution of a System of Linear Congruences; Chapter 7. Dynamic Programming Solutions; 1 A Dynamic Programming Solution; 2 Reducing the Number of Congruences; 3 An Accelerated Dynamic Programming Solution; Chapter 8. Branch and Bound Procedures; 1 A Branch and Bound Method; 2 Tightening the Bounds; 3 The Mixed Integer Problem
AUTHOR INDEXSUBJECT INDEX;