Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
An elementary, but fundamental, operation in disjunctive programming is a basic step, which is the intersection of two disjunctions to form a new disjunction. Basic steps bring a disjunctive set in regular form closer to its disjunctive normal form and, in turn, produce relaxations that are at least...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Elsevier
2018
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/e96e23b9be534d01b99b1c340a647d6c |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|