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.

- Credit for the tutorial will be awarded for obtaining at least 50 % of the points in each set of homework problems.
- There will be 5 sets of problems on:
- Modeling (deadline: 11.04.)
- Theory and Definitions (deadline: 11.04.)
- Methods for Solving Integer Programs (deadline: 02.05.)
- Software (deadline: 16.05.)
- Special Cases & Bonus (deadline: 31.05.)

✔ = 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 | ✔ | ✔ | ✔ | ✔ | ✘ |

Lagrange decomposition. Set covering and the greedy algorithm.

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

Knapsack problem. Traveling salesman problem.

Solutions of homework set 3. Modeling languages and solvers.

- GAMS Tutorial
- NEOS Server (online access to various optimization solvers)
- Solvers: Gurobi, CPLEX, SCIP, CBC, ...

Preprocessing and heuristics. Knapsack problem.

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

Solutions of homework sets 1 & 2.

Gomory cuts for pure and mixed integer linear programs.

Complexity. Lexicographic method and the first Gomory algorithm.

No tutorial!

Comparing formulations. Unimodularity and total unimodularity.

The art of formulating integer programs.

- 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

- The Not So Short Introduction to LaTeX (eng, cz)
- LaTeX Wikibook