A decomposition heuristic for mixed-integer supply chain problems
Year of publication: |
2020
|
---|---|
Authors: | Schewe, Lars ; Schmidt, Martin ; Weninger, Dieter |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 3, p. 225-232
|
Subject: | Alternating direction method | Decomposition | Mixed-integer optimization | Penalty method | Supply chain | Lieferkette | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Dekompositionsverfahren | Decomposition method | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming |
-
Tapia-Ubeda, Francisco J., (2018)
-
Using decomposition to improve greedy solutions of the optimal diversity management problem
Agra, Agostinho, (2013)
-
Progressive selection method for the coupled lot-sizing and cutting-stock problem
Wu, Tao, (2017)
- More ...
-
Computing optimality certificates for convex mixed-integer nonlinear problems
Halbig, Katrin, (2024)
-
Krug, Richard, (2024)
-
Computing technical capacities in the European entry-exit gas market is NP-hard
Schewe, Lars, (2020)
- More ...