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...
Enregistré dans:
Auteurs principaux: | DimitriJ. Papageorgiou, Francisco Trespalacios |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Elsevier
2018
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/e96e23b9be534d01b99b1c340a647d6c |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
Documents similaires
-
Lagrangian decompositions for the two-level FTTx network design problem
par: Andreas Bley, et autres
Publié: (2013) -
A Lagrangian-ACO matheuristic for car sequencing
par: Dhananjay Thiruvady, et autres
Publié: (2014) -
Reflections on generating (disjunctive) cuts
par: Florent Cadoux, et autres
Publié: (2013) -
Intersection cuts from multiple rows: a disjunctive programming approach
par: Egon Balas, et autres
Publié: (2013) -
Robust combinatorial optimization under convex and discrete cost uncertainty
par: Christoph Buchheim, et autres
Publié: (2018)