Lifted Cover Inequalities for 0-1 Integer Programs: Computation
研究了在0-1整数规划的分支切割算法中，如何有效使用提升覆盖不等式和提升GUB覆盖不等式，通过测试多种策略找出最佳实践方案。
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.