Reflections on generating (disjunctive) cuts
We consider the problem of constructing generic supporting hyperplanes to be used within a (branch and) bound-and-cut algorithm. We review some of the properties that these hyperplanes should enjoy. It is generally admitted that they should cut a parasitic point generated during the process. We argu...
Guardado en:
Autores principales: | Florent Cadoux, Claude Lemaréchal |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2013
|
Materias: | |
Acceso en línea: | https://doaj.org/article/5732b43850a545a9af5d3d75315544b9 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Intersection cuts from multiple rows: a disjunctive programming approach
por: Egon Balas, et al.
Publicado: (2013) -
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
por: DimitriJ. Papageorgiou, et al.
Publicado: (2018) -
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
por: Mervat Chouman, et al.
Publicado: (2018) -
The summed start-up costs in a unit commitment problem
por: René Brandenberg, et al.
Publicado: (2017) -
PANDA: a software for polyhedral transformations
por: Stefan Lörwald, et al.
Publicado: (2015)