Downloads¶
The lecture notes and the exercise book in PDF, with the same numbering of definitions, theorems, examples and exercises as the website, the lecture slides and the Colab notebooks with the code of the algorithms. Text and figures are released under CC BY 4.0, the code under the MIT licence.
Lecture notes and exercises¶
| Volume | Contents | Chapters | File |
|---|---|---|---|
| Lecture notes | Heuristic algorithms for combinatorial optimization problems: primal and dual bounds and the evaluation of heuristics, constructive heuristics, local search, metaheuristics and MIP-based heuristics, applied to knapsack, packing, routing, scheduling and coloring problems. | 1–5 | PDF (1.7 MB) |
| Worked exercises | Worked exercises on the chapters of the lecture notes, heuristic algorithms: each exercise is followed by its complete solution. | 1–5 | PDF (0.6 MB) |
Slides¶
The lecture slides, one PDF per chapter (the long chapters in two parts), with the same definitions and examples as the lecture notes.
| Chapter | Title | File |
|---|---|---|
| 1 | Heuristic algorithms: definitions | PDF (0.4 MB) |
| 2 | Constructive heuristics (1/2) | PDF (0.6 MB) |
| 2 | Constructive heuristics (2/2) | PDF (0.7 MB) |
| 3 | Local search (1/2) | PDF (0.7 MB) |
| 3 | Local search (2/2) | PDF (0.6 MB) |
| 4 | Metaheuristics (1/2) | PDF (0.7 MB) |
| 4 | Metaheuristics (2/2) | PDF (0.8 MB) |
| 5 | MIP heuristics for the classical problems | PDF (0.8 MB) |
Colab notebooks¶
The code of the chapters, one notebook per chapter and per language, to run in Google Colab or to download (.ipynb links). How to use them: the notebooks page.
| Chapter | Python | C++ |
|---|---|---|
| 2. Constructive heuristics | ||
| 3. Local search | ||
| 4. Metaheuristics | ||
| 5. MIP heuristics for the classical problems |
Quiz question bank¶
All the self-assessment questions, by part and chapter, with the correct answer and the explanation; for the generated questions, whose numbers change at every start, a few examples.