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.

Скачать книгу бесплатно (djvu, 431 Kb)

---

Читать «Integer programming: facets, subadditivity, and duality for group and semi-group problems»