Lifted Cover Inequalities for 0-1 Integer Programs: Complexity

  title={Lifted Cover Inequalities for 0-1 Integer Programs: Complexity},
  author={Zonghao Gu and George L. Nemhauser and Martin W. P. Savelsbergh},
  journal={INFORMS Journal on Computing},
We investigate several complexity issues related to branch and cut algorithms for integer programming based on lifted cover inequalities LCIs We show that given a fractional point determining a violated LCI over all minimal covers is NP hard The main result is that there exists a class of knapsack instances for which any branch and cut algorithm based on LCIs has to evaluate an exponential number of nodes to prove optimality 

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 41 extracted citations

Separation algorithms for 0-1 knapsack polytopes

Math. Program. • 2010
View 4 Excerpts
Highly Influenced

Cover and Pack Inequalities for (Mixed) Integer Programming

Annals OR • 2005
View 4 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 17 references

A Hard Knapsack Problem

C. S. Chung, M. S. Hung, W. O. Rom
Naval • 1988
View 5 Excerpts
Highly Influenced

Lifting and complementing yields all the facets

E. Balas, E. Zemel
View 11 Excerpts
Highly Influenced

On the 0/1 knapsack polytope

Math. Program. • 1997
View 1 Excerpt

A characterization of knapsacks with the max

M. Laurent, A. Sassano

Integer and combinatorial optimization

Wiley interscience series in discrete mathematics and optimization • 1988
View 1 Excerpt

Similar Papers

Loading similar papers…