Integer Programming
Integer Programming
Facets, Subadditivity, and Duality for Group and Semi-Group Problems
Ellis L. Johnson
February 1987
Paperback
9780898711622
Looking for an inspection copy?
Please email academicmarketing@cambridge.edu.au to enquire about an inspection copy of this book.
AUD$64.50
exc GSTPaperback
This monograph considers pure integer programming problems which concern packing, partitioning or covering. For this class of problems, an algorithmic framework using a duality approach is offered. Furthermore, the author proposes for the first time a general framework for both packing and covering problems characterizing the convex whole of integer solutions.
Product details
February 1987Paperback
9780898711622
76 pages
250 × 172 × 7 mm
0.178kg
This item is not supplied by Cambridge University Press in your region. Please contact Soc for Industrial & Applied Mathematics for availability.
Table of Contents
- Integer Programming
- Cuts, Knapsacks, and a Cyclic Group Problem
- Finite Abelian Groups
- Gomory's Corner Polyhedra
- Blocking Polyhedra and Master Group Problems
- Araoz's Semigroup Problem
- Blockers and Polars for Master Semigroup Problems
- Subadditive and Minimal Valid Inequalities
- Subadditive Characterizations
- Duality.
