Sumários

Lesson 15

29 outubro 2026, 09:00 • Cristina Requejo

The facility location problem: a greedy heuristic.

The set covering problem: example, variants, pre-processing (reducing the number of columns and number of rows).

Lesson 14

26 outubro 2026, 09:00 • Cristina Requejo

The Knapsack Problem: binary knapsack model, the critical index, upper bound with linear relaxation, lower bounds with constructive heuristics.

The facility location problem.

Lesson 13

22 outubro 2026, 09:00 • Cristina Requejo

Modelling with binary variables: exercises. 
Integer Linear Programming modeling examples of combinatorial problems. 
The Knapsack Problem: definition and variants, the binary knapsack model.

Lesson 12

19 outubro 2026, 09:00 • Cristina Requejo

Solving ILP using the Branch & Bound method and the Excel Solver. 

Modelling with binary variables.

Lesson 11

15 outubro 2026, 09:00 • Cristina Requejo

4. Integer Linear Programming: definition, properties, an example, lower and upper bounds. Solving ILP using the Excel Solver.