M.Sc. Katrin Halbig
M.Sc. Katrin Halbig
Go to
Projects
Development of new Linear and MIP Techniques for Supply Chain Management
Supply Chain Management (SCM) deals with the combination of procurement, production, storage, transport and delivery of commodities. Problems of this kind occur in all kinds of industry branches. Since the integrated planning of these processes contains a high potential for optimization it is of great importance for the companies’ efficiency.
The method of choice to find optimal solutions in SCM is linear and integer programming. Nevertheless, there are big challenges to overcome – concerning both hardware and algorithms – due to very detailed and therefore large models. Additionally there may occur numerical difficulties that standard techniques cannot deal with.
As a consequence, the problem’s mathematical formulation has to be done carefully and new methods need to be implemented to improve the performance of MIP algorithms.
Contact
Katrin Halbig
Dieter Weninger
Coorporation
Zuse Institut Berlin (ZIB)
SAP
Development of new Linear and Integer Programming Techniques to solve Supply Chain Management Problems
(Third Party Funds Single)Term: since 1. March 2010
Funding source: Industrie
Publications
The SCIP Optimization Suite 9.0
(2024)
ISSN: 1438-0064
(Techreport)
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , :
Enabling research through the scip optimization suite 8.0
In: Acm Transactions on Mathematical Software 49 (2023), Article No.: 22
ISSN: 0098-3500
DOI: 10.1145/3585516
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , :
The SCIP Optimization Suite 8.0
(2021)
(Techreport)
, , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , :
Computing optimality certificates for convex mixed-integer nonlinear problems
(2021)
URL: https://opus4.kobv.de/opus4-trr154/frontdoor/index/index/docId/476/
(Techreport)
, , , , :
The SCIP Optimization Suite 7.0
In: Konrad-Zuse-Zentrum für Informationstechnik Berlin : ZIB-Report (2020)
(Techreport)
, , , , , , , , , , , , , , , , , , , , , , , , , , , :