Aggregation and mixed integer rounding to solve MIPs

Marchand, Hugues;Wolsey, Laurence
(1998)

Files

dp9839.pdf
  • Open Access
  • Adobe PDF
  • 135.92 KB
Download

Details

Authors
  • Marchand, Hugues
    Author
  • Wolsey, LaurenceUCLouvain
    Author
Abstract
A separation heuristic for mixed integer programs is presented that theoretically allows one to derive several families of "strong" valid inequalities for specific models and computationally gives results as good as or better than those obtained from several existing separation routines including flow cover and integer cover inequalities. The heuristic is based on aggregation of constraints of the original formulation and mixed integer rounding inequalities.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Marchand, H., & Wolsey, L. (1998). Aggregation and mixed integer rounding to solve MIPs (CORE Discussion Papers 1998/39). https://hdl.handle.net/2078.5/38706