Volume 37, Issue 6
Tackling Industrial-Scale Supply Chain Problems by Mixed-Integer Programming

Gerald Gamrath ,  Ambros Gleixner ,  Thorsten Koch ,  Matthias Miltenberger ,  Dimitri Kniasew ,  Dominik Schlögel ,  Alexander Martin and Dieter Weninger

10.4208/jcm.1905-m2019-0055

J. Comp. Math., 37 (2019), pp. 866-888.

Preview Full PDF BiBTex 6 135
  • Abstract

The modeling flexibility and the optimality guarantees provided by mixed-integer programming greatly aid the design of robust and future-proof decision support systems. The complexity of industrial-scale supply chain optimization, however, often poses limits to the application of general mixed-integer programming solvers. In this paper we describe algorithmic innovations that help to ensure that MIP solver performance matches the complexity of the large supply chain problems and tight time limits encountered in practice. Our computational evaluation is based on a diverse set, modeling real-world scenarios supplied by our industry partner SAP.

  • History

Published online: 2019-11

  • Cited by