Name
Title | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/s10107-002-0315-0 | Mathematical Programming |
Keywords | Field | DocType |
General Setting,Integer Programming,Mixed Integer,Mixed Integer Programming,Finite Subset | Discrete mathematics,Mathematical optimization,Combinatorics,Table of Gaussian integer factorizations,Branch and price,Integer points in convex polyhedra,Integer programming,Prime factor,Radical of an integer,Mathematics,Highly cototient number,Integer sequence | Journal |
Volume | Issue | ISSN |
94 | 2-3 | 1436-4646 |
Citations | PageRank | References |
6 | 0.66 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Henk | 1 | 13 | 3.50 |
| Matthias KöPpe | 2 | 191 | 20.95 |
| Robert Weismantel | 3 | 964 | 90.05 |