Ellis L. Johnson
CBMS-NSF Regional Conference Series in Applied Mathematics 32
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.
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.
1980 / vii + 68 pages / Softcover / ISBN-13: 978-0-898711-62-2 / ISBN-10: 0-89871-162-2 /
List Price $38.00 / SIAM/CBMS Member Price $26.60 / Order Code CB32
|
