Intersection cuts from multiple rows: a disjunctive programming approach
We address the issue of generating cutting planes for mixed integer programs from multiple rows of the simplex tableau with the tools of disjunctive programming. A cut from q rows of the simplex tableau is an intersection cut from a q-dimensional parametric cross-polytope, which can also be viewed a...
Enregistré dans:
Auteurs principaux: | Egon Balas, Andrea Qualizza |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Elsevier
2013
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/3d9c31ceab644ecab7c0a6c95cc0d7a6 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Optimal capacitated ring trees
par: Alessandro Hill, et autres
Publié: (2016) -
The complete vertex p-center problem
par: F.Antonio Medrano
Publié: (2020) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
par: C. Gentile, et autres
Publié: (2017) -
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
par: Thais Ávila, et autres
Publié: (2017) -
An exploratory computational analysis of dual degeneracy in mixed-integer programming
par: Gerald Gamrath, et autres
Publié: (2020)