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...
Guardado en:
Autores principales: | Egon Balas, Andrea Qualizza |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2013
|
Materias: | |
Acceso en línea: | https://doaj.org/article/3d9c31ceab644ecab7c0a6c95cc0d7a6 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Optimal capacitated ring trees
por: Alessandro Hill, et al.
Publicado: (2016) -
The complete vertex p-center problem
por: F.Antonio Medrano
Publicado: (2020) -
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
por: C. Gentile, et al.
Publicado: (2017) -
Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem
por: Thais Ávila, et al.
Publicado: (2017) -
An exploratory computational analysis of dual degeneracy in mixed-integer programming
por: Gerald Gamrath, et al.
Publicado: (2020)