Integer Programming

The tutorial is scheduled on Tuesday at 10:40 in S321 (corridor on the 3rd floor). If you have any questions, you can reach me via e-mail at elif@kam.mff.cuni.cz.

Homework

Points

✔ = at least 50%, ✘ = less than 50%

Nickname S1 S2 S3 S4 S5 Σ
Maximalist student 10 10 10 10 10 50
AK
DF
JP
KK
MS
OK
RH

Covered Topics

23.05.2017

Lagrange decomposition. Set covering and the greedy algorithm.

16.05.2017

Column generation. Benders decomposition. Facility location problem and its properties.

09.05.2017

Knapsack problem. Traveling salesman problem.

02.05.2017

Solutions of homework set 3. Modeling languages and solvers.

25.04.2017

Preprocessing and heuristics. Knapsack problem.

18.04.2017

Chvátal-Gomory cuts. Branch and bound methods.

11.04.2017

Solutions of homework sets 1 & 2.

04.04.2017

Gomory cuts for pure and mixed integer linear programs.

28.03.2017

Complexity. Lexicographic method and the first Gomory algorithm.

21.03.2017

No tutorial!

14.03.2017

Comparing formulations. Unimodularity and total unimodularity.

07.03.2017

The art of formulating integer programs.

Resources and Study Materials

  • Lecture notes by M. Hladík (in Czech)
  • Integer Programming (L. Wolsey)
  • Theory of Linear and Integer Programming (A. Schrijver)
  • Applied Integer Programming (D. Chen et al.)
  • Integer Programming (M. Conforti et al.)
  • Modeling cookbooks by Mosek and Fico

Typesetting mathematical texts: