Abstract
We review the necessary background on Corner Polyhedra and use this to show how knowledge about Corner Polyhedra and subadditive functions translates into a great variety of cutting planes for general integer programming problems. Experiments are described that indicate the dominance of a relatively small number of the facets of Corner Polyhedra. This has implications for their value as cutting planes.
Original language | English (US) |
---|---|
Pages (from-to) | 321-339 |
Number of pages | 19 |
Journal | Mathematical Programming, Series B |
Volume | 96 |
Issue number | 2 |
DOIs | |
State | Published - May 1 2003 |