Cutting planes in integer and mixed integer programming

Marchand, Hugues;Wolsey, Laurence;Martin, Alexander;Weismantel, Robert
(1999)

Files

dp9953.pdf
  • Open Access
  • Adobe PDF
  • 334.76 KB
Download

Details

Authors
  • Marchand, Hugues
    Author
  • Wolsey, LaurenceUCLouvain
    Author
  • Martin, Alexander
    Author
  • Weismantel, Robert
    Author
Abstract
This survey presents cutting planes that are useful or potentially useful in solving mixed integer programs. Valid inequalities for i) general integer programs, ii) problems with local structure such as knapsack constraints, and iii) problems with 0-1 coefficient matrices, such as set packing, are examined in turn. Finally the use of valid inequalities for classes of problems with structure, such as network design, is explored.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Marchand, H., Wolsey, L., Martin, A., & Weismantel, R. (1999). Cutting planes in integer and mixed integer programming (CORE Discussion Papers 1999/53). https://hdl.handle.net/2078.5/35667