Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming

Gamrath G, Gleixner A, Koch T, Miltenberger M, Kniasew D, Schlögel D, Martin A, Weninger D (2019)

Publication Language: English

Publication Type: Journal article

Publication year: 2019

Journal

Journal of Computational Mathematics Science Press

City/Town: Takustr. 7, 14195 Berlin

URI: https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/6110

DOI: 10.4208/jcm.1905-m2019-0055

Abstract

SAP's decision support systems for optimized supply network planning rely on mixed-integer programming as the core engine to compute optimal or near-optimal solutions. The modeling flexibility and the optimality guarantees provided by mixed-integer programming greatly aid the design of a robust and future-proof decision support system for a large and diverse customer base. In this paper we describe our coordinated efforts to ensure that the performance of the underlying solution algorithms matches the complexity of the large supply chain problems and tight time limits encountered in practice.

Authors with CRIS profile

Alexander Martin Economics - Discrete Optimization - Mathematics (EDOM) Dieter Weninger Economics - Discrete Optimization - Mathematics (EDOM)

Related research project(s)

Development of new Linear and Integer Programming Techniques to solve Supply Chain Management Problems March 1, 2010 - March 1, 2013

Involved external institutions

Konrad-Zuse-Zentrum für Informationstechnik / Zuse Institute Berlin (ZIB) DE Germany (DE) SAP AG/SAP SE DE Germany (DE)

How to cite

APA:

Gamrath, G., Gleixner, A., Koch, T., Miltenberger, M., Kniasew, D., Schlögel, D.,... Weninger, D. (2019). Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming. Journal of Computational Mathematics. https://doi.org/10.4208/jcm.1905-m2019-0055

MLA:

Gamrath, Gerald, et al. "Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming." Journal of Computational Mathematics (2019).

BibTeX: Download