TY  - INPR
A1  - Schewe, Lars
A1  - Schmidt, Martin
A1  - Weninger, Dieter
T1  - A Decomposition Heuristic for Mixed-Integer Supply Chain Problems
T2  - Operations Research Letters
N2  - Mixed-integer supply chain models typically are very large but are also very sparse and can be decomposed into loosely coupled blocks. In this paper, we use general-purpose techniques to obtain a block decomposition of supply chain instances and apply a tailored penalty alternating direction method, which exploits the structural properties of the decomposed instances. We further describe problem-specific enhancements of the algorithm and present numerical results on real-world instances that illustrate the applicability of the approach.
KW  - Supply chain
KW  - Mixed-integer optimization
KW  - Decomposition
KW  - Penalty method
KW  - Alternating direction methods
Y1  - 2019
UR  - https://opus4.kobv.de/opus4-trr154/frontdoor/index/index/docId/258
IS  - 48(3)
SP  - 225
EP  - 232
ER  -