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.
Poslušate lahko zvočne knjige, ki ste jih kupili v Googlu Play v brskalniku računalnika.
Bralniki e-knjig in druge naprave
Če želite brati v napravah, ki imajo zaslone z e-črnilom, kot so e-bralniki Kobo, morate prenesti datoteko in jo kopirati v napravo. Podrobna navodila za prenos datotek v podprte bralnike e-knjig najdete v centru za pomoč.