Geometric Integer Programming

Aus VISki
Wechseln zu: Navigation, Suche

Overview

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.

Content

Key topics are:

  • lattice theory and the polynomial time solvability of integer optimization problems in fixed dimension,
  • the theory of integral generating sets and its connection to totally dual integral systems,
  • finite cutting plane algorithms based on lattices and integral generating sets.

Summaries

Exam Solutions

  • no exam solutions here yet

Additional Material

Literature

  • no literature here yet