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...
Saved in:
Main Authors: | Egon Balas, Andrea Qualizza |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2013
|
Subjects: | |
Online Access: | https://doaj.org/article/3d9c31ceab644ecab7c0a6c95cc0d7a6 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Optimal capacitated ring trees
by: Alessandro Hill, et al.
Published: (2016) -
The complete vertex p-center problem
by: F.Antonio Medrano
Published: (2020) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
by: C. Gentile, et al.
Published: (2017) -
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
by: Thais Ávila, et al.
Published: (2017) -
An exploratory computational analysis of dual degeneracy in mixed-integer programming
by: Gerald Gamrath, et al.
Published: (2020)