Lesson 18

6 Novembro 2025, 09:00 • Cristina Requejo

Sequencing Problem.

5. Heuristics: introduction, types of heuristics, the local search heuristic.

---

Lesson 17

3 Novembro 2025, 09:00 • Cristina Requejo

The traveling salesperson problem: models (cut formulation and MTZ formulation), relaxations (assignment and LP), constructive heuristic (the nearest neighbor) and improvement heuristics (the 2-opt heuristic and the 2-opt neighborhood).

---

Lesson 16

30 Outubro 2025, 09:00 • Cristina Requejo

The set covering problem: variants, pre-processing (reducing the number of columns and number of lines) and a greedy constructive heuristic.

The traveling salesperson problem: introduction.

---

Lesson 15

27 Outubro 2025, 09:00 • Cristina Requejo

The facility location problem: a greedy heuristic.

The set covering problem: example.

---

Lesson 14

23 Outubro 2025, 09:00 • Cristina Requejo

Integer Linear Programming modeling examples of combinatorial problems. The Knapsack Problem: binary knapsack model, the critical index, upper bound with linear relaxation, lower bounds with constructive heuristics.

---