Teaching
Teaching
My teaching material is organised as a series of 14 courses built the same way: lecture notes online and in PDF, exercises with solutions, an interactive lab and self-assessment quizzes, in English and Italian, openly accessible. At Sapienza, the master's course Integer Programming and Combinatorial Optimization (Management Engineering, since 2021) uses Integer Linear Programming, Combinatorial Optimization Problems, Dynamic Programming, Heuristic Algorithms, Approximation Algorithms and MIP Modelling.
Current courses
Courses
real numbers, functions, limits, derivatives and series, with interactive graphs
vectors, matrices, determinants, linear systems and eigenvalues, with the computation lab
number representation, pseudo-code, sorting and searching, analysis and recursive algorithms
polyhedra, the simplex algorithm, duality and the dual simplex, with the interactive lab
LP relaxation, valid inequalities, cutting planes, branch-and-bound and branch-and-cut
convex sets and functions, convex optimization problems, with interactive graphs
graphs, spanning trees, shortest paths, network flows, the network simplex and project management
knapsack, bin packing, coloring, TSP, scheduling and lot sizing: the problems, their formulations and ad hoc algorithms
principles and DP algorithms for knapsack, lot sizing, coin change and rod cutting
constructive heuristics, local search, metaheuristics and MIP heuristics for combinatorial optimization problems
performance guarantees, approximation schemes and limits of approximation for combinatorial problems
linear programming models of managerial problems, solved with Python and Gurobi
nonlinear programming models, from portfolios to machine learning, with Python and Gurobi
integer linear programming models, from the formulation to the solution with solvers
Tools
Interactive tools
Interactive tools I use and build for teaching.
Bomberino
An interactive workbench for operations research algorithms: primal and dual simplex, Gomory cutting planes and branch-and-bound on small linear and integer programs. Every pivot, bound, cut and branching step is recorded in exact fractions, and the worked exercise exports to LaTeX.
Doctoral
PhD courses and schools
- 2023Integer Programming Formulations and Exact Algorithms for Hard Combinatorial Optimization Problems on GraphsCIMPA Research School on Graph Structure and Complex Network Analysis
- 2019Benders DecompositionPhD course, University of Bologna
- 2019Dantzig-Wolfe DecompositionPhD course, IFSTAR, Lille
- 2015Column Generation for Hard Combinatorial ProblemsPhD course, Université Paris Dauphine-PSL
Previously
Past teaching
- Sapienza University of RomeCombinatorial Optimization and Integer Programming (Master's)
- University of Modena and Reggio EmiliaOttimizzazione lineare intera (Bachelor's)
- University of ParmaQuantitative Methods and Optimization (Master's)
- Université Paris Dauphine-PSLProgrammation linéaire · Programmation linéaire avancée · Optimisation combinatoire · Outils d'optimisation pour les sciences des données et de la décision · Optimisation en finance · Gestion de la production · Humanitarian logistics · Système de gestion de bases de données