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

401-3903-11L 6 Credits DR , MSC D-MATH , D-INFK

Geometric Integer Programming

Lecturers: Dr. Joseph Paat
VVZ CR n/a

Last Updated: 2026-02-05 15:41:56

Abstract

Integer programming is the task of minimizing a linear function over all the integer points in a polyhedron. This lecture introduces the key concepts of an algorithmic theory for solving such problems.

Objective

The purpose of the lecture is to provide a geometric treatment of the theory of integer optimization.

Content

Key topics are: - Lattice theory and the polynomial time solvability of integer optimization problems in fixed dimension. - Structural properties of integer sets that reveal other parameters affecting the complexity of integer problems - Duality theory for integer optimization problems from the vantage point of lattice free sets.

Resources

Lecture Notes

not available, blackboard presentation

Literature

Lecture notes will be provided. Other helpful materials include Bertsimas, Weismantel: Optimization over Integers, 2005 and Schrijver: Theory of linear and integer programming, 1986.

Learning Materials (Links)

General Information

Language
English
Levels
DR , MSC

Examination

Type
session examination
Mode
oral 30 minutes
The exam will not be offered after the Summer 2021 Examination Session

Course Components

Type Title Time & Place Hours
lecture Geometric Integer Programming
  • Thu 13:15-15:00 (HG E 33.3)
2 h weekly
exercise Geometric Integer Programming
  • Wed 12:15-13:00 (HG E 33.3)
1 h weekly

Offered In