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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!