Chvatal-Gomory-tier cuts for general integer programs

Authors:
Fred Glover;Hanif D. Sherali
Affiliations:
Leeds School of Business, University of Colorado, Campus Box 419, Boulder, CO 80309-0419, USA;Grado Department of Industrial and Systems Engineering (0118), Virginia Polytechnic Institute and State University, Blacksburg, VA 24061, USA
Venue:
Discrete Optimization
Year:
2005

Citing 7
Cited 0

A recursive procedure to generate all cuts for 0-1 mixed integer programs

Mathematical Programming: Series A and B
{0, 12 }-Chva´tal-Gomory cuts

Mathematical Programming: Series A and B
Generating Cuts from Surrogate Constraint Analysis for Zero-Oneand Multiple Choice Programming

Computational Optimization and Applications
Combining and Strengthening Gomory Cuts

Proceedings of the 4th International IPCO Conference on Integer Programming and Combinatorial Optimization
Aggregation and Mixed Integer Rounding to Solve MIPs

Operations Research
K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau

INFORMS Journal on Computing
Foundation-penalty cuts for mixed-integer programs

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new class of cutting planes called Chvatal-Gomory (CG)-tier cuts. These cuts are predicated on a scaling parameter d and an integer tier-level parameter p, where 1=