Extended formulations for Gomory Corner polyhedra

Authors:
Matthias KöPpe;Quentin Louveaux;Robert Weismantel;Laurence A. Wolsey
Affiliations:
Department of Mathematics/IMO, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106 Magdeburg, Germany;CORE, Université catholique de Louvain, Voie du Roman Pays 34, 1348 Louvain-la-Neuve, Belgium;Department of Mathematics/IMO, Otto-von-Guericke-Universität Magdeburg, Universitätsplatz 2, 39106 Magdeburg, Germany;CORE, Université catholique de Louvain, Voie du Roman Pays 34, 1348 Louvain-la-Neuve, Belgium
Venue:
Discrete Optimization
Year:
2004

Citing 1
Cited 2

Non-standard approaches to integer programming

Discrete Applied Mathematics

Mixed-integer cuts from cyclic groups

IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
How tight is the corner relaxation?

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present several types of extended formulations for integer programs, based on irreducible integer solutions to Gomory's group relaxations. We present algorithmic schemes based on an iterative reformulation technique using these extended formulations. We give computational results for benchmark problems, which illustrate the primal and dual effect of the reformulation.