Integral decomposition of polyhedra and some applications in mixed integer programming
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
This paper addresses the question of decomposing an infinite family of rational polyhedra in an integer fashion. It is shown that there is a finite subset of this family that generates the entire family. Moreover, an integer analogue of Carathéodory's theorem carries over to this general setting. The integer decomposition of a family of polyhedra has some applications in integer and mixed integer programming, including a test set approach to mixed integer programming.
- Integral decomposition of polyhedra and some applications in mixed integer programming
Volume 94, Issue 2-3 , pp 193-206
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors