Gomory cuts revisited
- 1 July 1996
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 19 (1) , 1-9
- https://doi.org/10.1016/0167-6377(96)00007-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Solving Airline Crew Scheduling Problems by Branch-and-CutManagement Science, 1993
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- Solving Mixed Integer Programming Problems Using Automatic ReformulationOperations Research, 1987
- Solving Large-Scale Zero-One Linear Programming ProblemsOperations Research, 1983
- Report of the Session onAnnals of Discrete Mathematics, 1979
- Using cutting planes to solve the symmetric Travelling Salesman problemMathematical Programming, 1978
- Integer Linear Programming: A Study in Computational EfficiencyManagement Science, 1969
- A Computer Code for Integer Solutions to Linear ProgramsOperations Research, 1965
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958