909:-
Tillfälligt slut online – klicka på "Bevaka" för att få ett mejl så fort varan går att köpa igen.
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.
- Format: Pocket/Paperback
- ISBN: 9780898711622
- Språk: Engelska
- Antal sidor: 76
- Utgivningsdatum: 1987-01-01
- Förlag: Society for Industrial and Applied Mathematics