Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
研究在分支切割框架中集成通用切割面求解混合0-1规划的计算问题，通过实验比较确定最佳方案，开发出稳健求解器，在广泛测试中表现优于或持平于现有最优代码。
We investigate the computational issues that need to be addressed when incorporating general cutting planes for mixed 0-1 programs into a branch-and-cut framework. The cuts we use are of the lift-and-project variety. Some of the issues addressed have a theoretical answer, but others are of an experimental nature and are settled by comparing alternatives on a set of test problems. The resulting code is a robust solver for mixed 0-1 programs. We compare it with several existing codes. On a wide range of test problems it performs as well as, or better than, some of the best currently available mixed integer programming codes.