  Theory of Linear and Integer Programming
ISBN: 978-0-471-98232-6
Paperback
484 pages
July 1998
US $110.00
 Add to Cart
This price is valid for United States. Change location to view local pricing and availability. This is a Print-on-Demand title. It will be printed specifically to fill your order. Please allow an additional 1-2 days delivery time for paperbacks, and 3-5 days for hardcovers. The book is not returnable.
|
Introduction and Preliminaries.
Problems, Algorithms, and Complexity.
LINEAR ALGEBRA.
Linear Algebra and Complexity.
LATTICES AND LINEAR DIOPHANTINE EQUATIONS.
Theory of Lattices and Linear Diophantine Equations.
Algorithms for Linear Diophantine Equations.
Diophantine Approximation and Basis Reduction.
POLYHEDRA, LINEAR INEQUALITIES, AND LINEAR PROGRAMMING.
Fundamental Concepts and Results on Polyhedra, Linear Inequalities, and Linear Programming.
The Structure of Polyhedra.
Polarity, and Blocking and Anti-Blocking Polyhedra.
Sizes and the Theoretical Complexity of Linear Inequalities and Linear Programming.
The Simplex Method.
Primal-Dual, Elimination, and Relaxation Methods.
Khachiyan's Method for Linear Programming.
The Ellipsoid Method for Polyhedra More Generally.
Further Polynomiality Results in Linear Programming.
INTEGER LINEAR PROGRAMMING.
Introduction to Integer Linear Programming.
Estimates in Integer Linear Programming.
The Complexity of Integer Linear Programming.
Totally Unimodular Matrices: Fundamental Properties and Examples.
Recognizing Total Unimodularity.
Further Theory Related to Total Unimodularity.
Integral Polyhedra and Total Dual Integrality.
Cutting Planes.
Further Methods in Integer Linear Programming.
References.
Indexes.
Problems, Algorithms, and Complexity.
LINEAR ALGEBRA.
Linear Algebra and Complexity.
LATTICES AND LINEAR DIOPHANTINE EQUATIONS.
Theory of Lattices and Linear Diophantine Equations.
Algorithms for Linear Diophantine Equations.
Diophantine Approximation and Basis Reduction.
POLYHEDRA, LINEAR INEQUALITIES, AND LINEAR PROGRAMMING.
Fundamental Concepts and Results on Polyhedra, Linear Inequalities, and Linear Programming.
The Structure of Polyhedra.
Polarity, and Blocking and Anti-Blocking Polyhedra.
Sizes and the Theoretical Complexity of Linear Inequalities and Linear Programming.
The Simplex Method.
Primal-Dual, Elimination, and Relaxation Methods.
Khachiyan's Method for Linear Programming.
The Ellipsoid Method for Polyhedra More Generally.
Further Polynomiality Results in Linear Programming.
INTEGER LINEAR PROGRAMMING.
Introduction to Integer Linear Programming.
Estimates in Integer Linear Programming.
The Complexity of Integer Linear Programming.
Totally Unimodular Matrices: Fundamental Properties and Examples.
Recognizing Total Unimodularity.
Further Theory Related to Total Unimodularity.
Integral Polyhedra and Total Dual Integrality.
Cutting Planes.
Further Methods in Integer Linear Programming.
References.
Indexes.
Share This
