VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.

401-3902-DRL 2 Credits DR D-MATH
You're viewing possible stale or outdated data. Please check the latest semester for more up-to-date information.

Network & Integer Optimization: From Theory to Application

Lecturers & Examiners: Prof. Dr. Rico Zenklusen
Only for ETH D-MATH doctoral students and for doctoral students from the Institute of Mathematics at UZH. The latter need to send an email to Jessica Bolsinger ( ) with the course number. The email should have the subject „Graduate course registration (ETH)“.
VVZ CR 1.6

Last Updated: 2026-02-05 16:07:26

Abstract

This course covers various topics in Network and (Mixed-)Integer Optimization. It starts with a rigorous study of algorithmic techniques for some network optimization problems (with a focus on matching problems) and moves to key aspects of how to attack various optimization settings through well-designed (Mixed-)Integer Programming formulations.

Objective

Our goal is for students to both get a good foundational understanding of some key network algorithms and also to learn how to effectively employ (Mixed-)Integer Programming formulations, techniques, and solvers, to tackle a wide range of discrete optimization problems.

Content

Key topics include: - Matching problems; - Integer Programming techniques and models; - Extended formulations and strong problem formulations; - Solver techniques for (Mixed-)Integer Programs; - Decomposition approaches.

Resources

Literature

- Bernhard Korte, Jens Vygen: Combinatorial Optimization. 6th edition, Springer, 2018. - Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003. This work has 3 volumes. - Vanderbeck François, Wolsey Laurence: Reformulations and Decomposition of Integer Programs. Chapter 13 in: 50 Years of Integer Programming 1958-2008. Springer, 2010. - Alexander Schrijver: Theory of Linear and Integer Programming. John Wiley, 1986.

General Information

Language
English
Levels
DR
Frequency
Yearly recurring

Examination

Type
ungraded semester performance

Registration & Places

Priority: Registration for the course unit is only possible for the primary target group

Course Components

Type Title Time & Place Hours
lecture with exercise Network & Integer Optimization: From Theory to Application
  • Mon 12:15-14:00 (HG E 1.1)
  • Thu 13:15-14:00 (HG E 1.1)
3 h weekly

Offered In

  • Doctorate Mathematics (More Information at: )
    • Subject Specialisation (The list of courses (together with the allocated credit points) eligible for doctoral students is published each semester in the newsletter of the ZGSM.)
      • Graduate School (Official website of the Zurich Graduate School in Mathematics: In addition to the 401-....-DRL course units, adapted versions for doctoral students of the following course units: 263-4400-00L Advanced Graph Algorithms and Optimization 401-3902-21L Network & Integer Optimization: From Theory to Application 401-3904-22L Convex Optimization 401-3629-00L Quantitative Risk Management 401-3652-00L Numerical Methods for Hyperbolic Partial Differential Equations 151-0530-00L Nonlinear Dynamics and Chaos II 227-0434-10L Mathematics of Information 401-4490-22L Topology Optimization of Engineering Systems ... (continued ))