Integer Programming
Facets, Subadditivity, and Duality for Group and Semi-Group Problems
Häftad, Engelska, 1987
749 kr
Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.
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.
Produktinformation
- Utgivningsdatum1987-02-28
- Mått152 x 229 x undefined mm
- Vikt180 g
- FormatHäftad
- SpråkEngelska
- SerieCBMS-NSF Regional Conference Series in Applied Mathematics
- Antal sidor75
- FörlagSociety for Industrial & Applied Mathematics,U.S.
- ISBN9780898711622