论文信息 - Integral decomposition of polyhedra and some applications in mixed integer programming

Integral decomposition of polyhedra and some applications in mixed integer programming

Abstract. 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.

[1] Laurence A. Wolsey,et al. Non-standard approaches to integer programming , 2002, Discret. Appl. Math..

[2] András Sebö,et al. Hilbert Bases, Caratheodory's Theorem and Combinatorial Optimization , 1990, IPCO.

[3] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[4] P. Gordan. Ueber die Auflösung linearer Gleichungen mit reellen Coefficienten , 1873 .

[5] G. C. Shephard,et al. Convex Polytopes , 1969, The Mathematical Gazette.

[6] H. Minkowski. Allgemeine Lehrsätze über die konvexen Polyeder , 1989 .

[7] Alexander Martin,et al. A counterexample to an integer analogue of Carathéodory's theorem , 1999 .

[8] László Lovász,et al. The Shapes of Polyhedra , 1990, Math. Oper. Res..

[9] Jack E. Graver,et al. On the foundations of linear and integer linear programming I , 1975, Math. Program..

[10] Gesammelte Abhandlungen , 1906, Nature.

[11] Shuhong Gao,et al. Decomposition of Polytopes and Polynomials , 2000, Discret. Comput. Geom..

[12] Z. Smilansky,et al. Decomposability of polytopes and polyhedra , 1987 .

[13] P. McMullen,et al. Representations of polytopes and polyhedral sets , 1973 .

[14] Walter Meyer. Indecomposable Polytopes , 1974 .

[15] W. Pulleyblank,et al. Total Dual Integrality and Integer Polyhedra , 1979 .