Projected Chvátal–Gomory cuts for mixed integer linear programs
- 8 December 2006
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 113 (2) , 241-257
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Combinatorial Benders' Cuts for Mixed-Integer Linear ProgrammingOperations Research, 2006
- Using rank-1 lift-and-project closures to generate cuts for 0–1 MIPs, a computational investigationDiscrete Optimization, 2005
- Optimizing over the First Chvàtal ClosureLecture Notes in Computer Science, 2005
- On the separation of split cuts and related inequalitiesMathematical Programming, 2003
- A polyhedral study of the asymmetric traveling salesman problem with time windowsNetworks, 2000
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- Chvátal closures for mixed integer programming problemsMathematical Programming, 1990
- Integer and Combinatorial Optimization1988
- Geometric Algorithms and Combinatorial Optimization1988
- Edmonds polytopes and a hierarchy of combinatorial problemsDiscrete Mathematics, 1973