Integer Programming
Facets, Subadditivity, and Duality for Group and Semi-Group Problems
Häftad, Engelska, 1987
579 kr
Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.
Beskrivning
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.