Sufficiency of cut-generating functions
Year of publication: |
2013-07-04
|
---|---|
Authors: | CORNUEJOLS, Gérard ; WOLSEY, Laurence ; YILDIZ, Sercan |
Institutions: | Center for Operations Research and Econometrics (CORE), École des Sciences Économiques de Louvain |
Subject: | mixed integer programming | separation | corner polyhedron | intersection cuts |
-
A note on the split rank of intersection cuts
SANTANU, Dey, (2008)
-
Intersection cuts from multiple rows : a disjunctive programming approach
Balas, Egon, (2013)
-
A new general-purpose algorithm for mixed-integer bilevel linear programs
Fischetti, Matteo, (2017)
- More ...
-
Tight bounds for Christofides' traveling salesman heuristic
CORNUEJOLS, Gérard,
-
Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms
CORNUEJOLS, Gérard,
-
Worst-case and probabilistic analysis of algorithms for a location problem
CORNUEJOLS, Gérard,
- More ...