Lifted Cover Inequalities for 0-1 Integer Programs: Computation

@article{Gu1998LiftedCI,
  title={Lifted Cover Inequalities for 0-1 Integer Programs: Computation},
  author={Zonghao Gu and George L. Nemhauser and Martin W. P. Savelsbergh},
  journal={INFORMS Journal on Computing},
  year={1998},
  volume={10},
  pages={427-437}
}
We investigate the algorithmic and implementation issues related to the e ective and e cient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for integer programming We have tried various strategies on several test problems and we identify the best ones for use in practice 
Highly Influential
This paper has highly influenced 15 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

References

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

Minto

  • G. L. Nemhauser, M.W.P. Savelsbergh, G. C. Sigismondi
  • a mixed integer opti- mizer. Operations Research…
  • 1993
Highly Influential
5 Excerpts

A note on the knapsack problem with special ordered sets

  • E. L. Johnson, M. Padberg
  • Operations Research Letters, 1:18{22
  • 1981
Highly Influential
15 Excerpts

Litfed cover inequalities for 0-1 and mixed 0-1 integer programs

  • Z. Gu
  • Technical report, Georgia Institute of…
  • 1995
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…