Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems
- 1 February 1997
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 97 (1) , 139-148
- https://doi.org/10.1016/0377-2217(95)00373-8
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Gomory cuts revisitedOperations Research Letters, 1996
- A Study of Indicators for Identifying Zero Variables in Interior-Point MethodsSIAM Review, 1994
- Fenchel Cutting Planes for Integer ProgramsOperations Research, 1994
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- Solution of large-scale symmetric travelling salesman problemsMathematical Programming, 1991
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- Lp-based combinatorial problem solvingAnnals of Operations Research, 1985
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Intersection Cuts—A New Type of Cutting Planes for Integer ProgrammingOperations Research, 1971