A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs

@article{Glover2007ACO,
  title={A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs},
  author={Fred Glover and Hanif D. Sherali},
  journal={IJCSE},
  year={2007},
  volume={3},
  pages={203-210}
}
Glover and Sherali (2003) introduced a wide class of Foundation-Penalty (FP) cuts for GUB and ordinary mixed-integer programs. The FP cuts are easy to generate by exploiting routine branch-and-bound penalty calculations, and encompass other classical cuts such as disjunctive cuts, lift-and-project cuts, convexity cuts, Gomory cuts, and mixed-integer rounding cuts. Here we focus on two special classes of FP cuts, called balanced FP cuts and multi-level balanced FP cuts, and exhibit their… CONTINUE READING

Citations

Publications citing this paper.

References

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

Optimization with disjunctive constraints’, Series in Economics and Mathematical Systems, Springer-Verlag, Berlin

  • H. D. Sherali, C. M. Shetty
  • HeidelbergNew York,
  • 1980
Highly Influential
15 Excerpts

Personal communication’, in Linderoth, J.T. and Savelsbergh, M.W.P. (Eds.): A Computational Study of Search Strategies for Mixed Integer Programming

  • D. Applegate, R. Bixby, W. Cook, V. Chvatal
  • INFORMS Journal on Computing,
  • 1996

Similar Papers

Loading similar papers…