A simplex-based algorithm for 0-1 mixed integer programming

Authors:
Jean-Philippe P. Richard;Ismael R. de Farias;George L. Nemhauser
Affiliations:
School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta GA;Center for Operations Research and Econometrics, 34 Voie du Roman Pays, 1348, Louvain-La-Neuve, Belgium;School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta GA
Venue:
Combinatorial optimization - Eureka, you shrink!
Year:
2003

Citing 6
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
A recursive procedure to generate all cuts for 0-1 mixed integer programs

Mathematical Programming: Series A and B
Easily computable facets of the knapsack polytope

Mathematics of Operations Research
A lift-and-project cutting plane algorithm for mixed 0-1 programs

Mathematical Programming: Series A and B
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity

INFORMS Journal on Computing
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

INFORMS Journal on Computing

Lifted Tableaux Inequalities for 0--1 Mixed-Integer Programs: A Computational Study

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a finitely convergent cutting plane algorithm for 0-1 mixed integer programming. The algorithm is a hybrid between a strong cutting plane and a Gomory-type algorithm that generates violated facet-defining inequalities of a relaxation of the simplex tableau and uses them as cuts for the original problem. We show that the cuts can be computed in polynomial time and can be embedded in a finitely convergent algorithm.