On the facets of mixed integer programs with two integer variables and two constraints

Authors:
Gérard Cornuéjols;François Margot
Affiliations:
Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA and LIF, Université d' Aix-Marseille, Faculté des Sciences de Luminy, France;Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA
Venue:
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Year:
2008

Citing 3
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
Chva´tal closures for mixed integer programming problems

Mathematical Programming: Series A and B
Matrix analysis and applied linear algebra

Matrix analysis and applied linear algebra

Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables and two constraints, and we give a complete characterization of its facets. We then derive an analogous characterization of the facets of the underlying finite integer program.