Strengthening Chvátal-Gomory cuts and Gomory fractional cuts

Authors:
Adam N. Letchford;Andrea Lodi
Affiliations:
Department of Management Science, Lancaster University, Lancaster LA1 4YW, UK;DEIS, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
Venue:
Operations Research Letters
Year:
2002

Citing 3
Cited 4

A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
On the Chvátal Rank of Certain Inequalities

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Elementary closures for integer programs

Operations Research Letters

Constraint integer programming: a new approach to integrate CP and MIP

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
An exact algorithm for the 0---1 linear knapsack problem with a single continuous variable

Journal of Global Optimization
A GRASP-based approach to the generalized minimum spanning tree problem

Expert Systems with Applications: An International Journal
Mixed-integer cuts from cyclic groups

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Chvatal-Gomory and Gomory fractional cuts are well-known cutting planes for pure integer programming problems. Various methods for strengthening them are known, for example based on subadditive functions or disjunctive techniques. We present a new and surprisingly simple strengthening procedure, discuss its properties, and present some computational results.