Sumários

Lesson n. 10

9 Outubro 2026, 11:00 • Maria Teresa Godinho

The Gomory 's cutting -plane algorithm. Example.

Valid inequalities: Chvátal- Gommory inequalities and inequalities based on problem-specific structure. Example.

Lesson n.º 9

8 Outubro 2026, 13:30 • Maria Teresa Godinho

Branch and Bound (continued)

Example.

lesson n. 8

2 Outubro 2026, 11:00 • Maria Teresa Godinho

Definition of relaxation and of the linear programming relaxation of an integer linear programming problem. Properties of the linear programming relaxation. Enumeration algorithms: introduction.

lesson n. 7

1 Outubro 2026, 13:30 • Maria Teresa Godinho

The Travelling Salesman Problem.

The Miller-Tucker-Zemlin formulation of the TSP.

Disjunctive constraints.

lesson n. 6

25 Setembro 2026, 11:00 • Maria Teresa Godinho

Integer Linear Programming (ILP): introduction, applications, basic concpts.

Modelling some classic ILP prpblems: the assignement, knapsack and lotsizing problems.