Cutting Planes for Integer Programs with General Integer Variables
We investigate the use of cutting planes for integer programs with general integer variables. We show how cutting planes arising from knapsack inequalities can be generated and lifted as in the case of 0-1 variables. We also explore the use of Gomory's mixed integer cuts. We address both theoretical and computational issues and show how to embed these cutting planes in a branch-and-bound framework. We compare results obtained by using our cut generation routines in two existing systems with a commercially available branch-and-bound code on a range of test problems arising from practical applications
Year of publication: |
1995-12-01
|
---|---|
Authors: | CERIA, Sebastian ; CORDIER, Cecile ; MARCHAND, Hugues ; WOLSEY, Laurence |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Saved in:
freely available
Saved in favorites
Similar items by person
-
bc-opt :A branch-and-cut code for mixed integer programs.
CORDIER, Cecile, (1997)
-
Cutting planes for integer programs with general integer variables
CERIA, Sebastian,
-
Cutting planes for integer programs with general integer variables
CERIA, Sebastian,
- More ...