Aggregation and mixed integer rounding to solve MIPs

Hugues Marchand () and Laurence A. Wolsey ()
Additional contact information
Hugues Marchand: Center for Operations Research and Econometrics (CORE), Université catholique de Louvain (UCL), Louvain la Neuve, Belgium
Laurence A. Wolsey: Center for Operations Research and Econometrics (CORE), Université catholique de Louvain (UCL), Louvain la Neuve, Belgium

No 1998039, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

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.

Keywords: mixed integer programming; cutting planes; Gomory mixed integer cuts. (search for similar items in EconPapers)
Date: 1998-06-01
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp1998.html (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:1998039

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().