Article ID: | iaor20041802 |
Country: | Germany |
Volume: | 96 |
Issue: | 2 |
Start Page Number: | 321 |
End Page Number: | 339 |
Publication Date: | Jan 2003 |
Journal: | Mathematical Programming |
Authors: | Johnson E.L., Gomory R.E., Evans L. |
Keywords: | cutting plane algorithms |
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.