INFORMS journal on computing · 1998 · 143 citations · 21 references
Natural SciencesComputer ScienceMathematicsAlgorithmsDiscrete MathematicsOptimizationBranch And BoundCombinatorial OptimizationInteger ProgrammingLinear ProgrammingMathematical Programming0-1 Integer ProgrammingBranch-and-cutInteger Programming Models
We investigate the algorithmic and implementation issues related to the effective and efficient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for 0-1 integer programming. We have tried various strategies on several test problems and we identify the best ones for use in practice.
21