Pseudo basic stepsbound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
Year of publication: |
March 2018
|
---|---|
Authors: | Papageorgiou, Dimitri J. ; Trespalacios, Francisco |
Published in: |
EURO journal on computational optimization. - Heidelberg : Springer, ISSN 2192-4406, ZDB-ID 2772752-X. - Vol. 6.2018, 1, p. 55-83
|
Subject: | Basic step | Disjunctive programming | K-means clustering | Lagrangian decomposition | Mixed-integer conic quadratic optimization | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Dekompositionsverfahren | Decomposition method |
-
Mohammadi, Mahsa, (2021)
-
A dynamic programming-based matheuristic for the dynamic berth allocation problem
Nishi, Tatsushi, (2020)
-
Scalable timing-aware network design via lagrangian decomposition
Lara, Cristiana L., (2023)
- More ...
-
A note on solving discretely-constrained Nash-Cournot games via complementarity
Papageorgiou, Dimitri J., (2021)
-
Trespalacios, Francisco, (2015)
-
Cutting plane algorithm for convex generalized disjunctive programs
Trespalacios, Francisco, (2016)
- More ...