1980 / vii + 68 pages / Softcover / ISBN: 978-0-898711-62-2 / List Price $42.00 / SIAM/CBMS Member Price $29.40 / Order Code CB32
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.
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.
This product hasn't received any reviews yet. Be the first to review this product!
All prices are in USD