A decomposition heuristic for mixed-integer supply chain problems
2020
Abstract 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.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
15
References
4
Citations
NaN
KQI