6229 Advanced Optimization in Supply Chain Management
Assoz.Prof PD Dr. Vera Hemmelmayr
Contact details
Weekly hours
Language of instruction
02/20/23 to 02/28/23
Registration via LPIS
Notes to the course
Day Date Time Room
Wednesday 03/01/23 10:00 AM - 12:15 PM TC.3.08
Wednesday 03/15/23 09:00 AM - 11:00 AM D5.1.001
Wednesday 03/22/23 09:00 AM - 03:00 PM D4.0.047
Wednesday 03/29/23 09:00 AM - 11:00 AM TC.3.03
Wednesday 04/12/23 09:00 AM - 11:00 AM TC.5.18
Wednesday 04/19/23 09:00 AM - 12:00 PM D4.0.047

In this course advanced optimization methods and tools are applied to problems in the area of supply chain management. The course starts with an overview of classical combinatorial optimization problems. The course also covers the theory and application of solution methods. Concepts of exact techniques (e.g. branch and bound, branch and cut), neighborhood search and metaheuristic solution techniques (e.g. adaptive large neighborhood search, tabu search, variable neighborhood search) are discussed and implemented to solve case studies. Furthermore, hands-on exercises with standard optimization tools such as Python/PuLP and cplex are conducted.

Learning outcomes

Learning outcomes

After successful completion of the course, students should be able to

  • Be familiar with the most relevant optimization models in the area of supply chain management
  • Model and solve optimization problems in supply chain management
  • Apply heuristic and exact solution techniques
  • Analyze and solve real-world problems in selected industries and businesses
Attendance requirements

Please note that your attendance at this course must be at least 80%.

Teaching/learning method(s)

Lectures, case studies, discussion and exercises

  • case study projects development and documentation (90 points)
  • case study project presentations (10 points)

Please log in with your WU account to use all functionalities of read!t. For off-campus access to our licensed electronic resources, remember to activate your VPN connection connection. In case you encounter any technical problems or have questions regarding read!t, please feel free to contact the library at

Last edited: 2023-02-15