Schewe L, Schmidt M, Weninger D (2020)
Publication Language: English
Publication Type: Journal article, Review article
Publication year: 2020
Article Number: 0167-6377
URI: http://www.sciencedirect.com/science/article/pii/S0167637720300249
DOI: 10.1016/j.orl.2020.02.006
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.
APA:
Schewe, L., Schmidt, M., & Weninger, D. (2020). A Decomposition Heuristic for Mixed-Integer Supply Chain Problems. Operations Research Letters. https://dx.doi.org/10.1016/j.orl.2020.02.006
MLA:
Schewe, Lars, Martin Schmidt, and Dieter Weninger. "A Decomposition Heuristic for Mixed-Integer Supply Chain Problems." Operations Research Letters (2020).
BibTeX: Download