Price-and-verify : a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition
Year of publication: |
2020
|
---|---|
Authors: | Gleixner, Ambros M. ; Maher, Stephen J. ; Müller, Benjamin ; Pedroso, João Pedro |
Published in: |
Decomposition methods for hard optimization problems. - New York, NY, USA : Springer. - 2020, p. 527-555
|
Subject: | Mixed-integer nonlinear programming | Dantzig-Wolfe decomposition | Symmetry breaking | Global optimization | Recursive circle packing | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dekompositionsverfahren | Decomposition method | Algorithmus | Algorithm | Nichtlineare Optimierung | Nonlinear programming |
-
An inexact column-and-constraint generation method to solve two-stage robust optimization problems
Tsang, Man Yiu, (2023)
-
Multi-dual decomposition solution for risk-averse facility location problem
Yu, Guodong, (2018)
-
Exact algorithms for budgeted prize-collecting covering subgraph problems
Morandi, N., (2022)
- More ...
-
Iterative refinement for linear programming
Gleixner, Ambros M., (2016)
-
Boland, Natashia, (2009)
-
Rehfeldt, Daniel Markus, (2022)
- More ...