Home
Welcome to the website!
Lectures
- RO_(01)_Introduzione.mp4
- Fondamenti di Ricerca Operativa: Problemi, Istanze e Funzioni Obiettivo
- Modellazione di Problemi di Ottimizzazione
- Introduction to Mathematical Programming
- Geometry of Linear Programming and Polyhedra
- Introduction to Integer Linear Programming
- Modelli di Programmazione Lineare Intera
- Analysis of Objective Functions and Constraints in Linear Programming
- Lecture Notes on Linear and Integer Programming: Constraints and Modeling
- Models of Classic Combinatorial Optimization Problems
- Lecture Notes on Integer Linear Programming Models for Combinatorial Optimization
- Linear Programming: Algorithms and Theory
- The Simplex Algorithm for Linear Programming
- Lecture Notes on Linear Programming
- Lecture Notes on the Simplex Method
- Geometric Interpretation of the Simplex Method
- Lecture Notes on Polyhedra and Valid Inequalities
- Lecture Notes on Valid Inequalities and Duality in Linear Programming
- Complementary Slackness Conditions in Linear Programming
- Lecture Notes on Duality in Linear Programming: Rules and Example
- Introduction to Integer Programming
- Integral Polyhedra and Totally Unimodular Matrices
- Branch and Bound for Integer Linear Programming
- The Cutting Plane Method for Integer Linear Programming
- Transition to Combinatorial Algorithms and Graph Representations
- Graph Connectivity and Traversal Algorithms
- Directed Acyclic Graphs and Topological Sorting
- Transitive Closure
- Network Design and Minimum Spanning Trees
- Prim’s Algorithm: Implementations and Optimizations
- Implementing and Understanding Kruskal’s Algorithm
- RO_(31)_Varianti_di_MST.mp4
- The Shortest Path Problem
- Beyond Linear Programming: Combinatorial Algorithms for Shortest Paths
- Shortest Paths in DAGs and Scheduling Problems
- The Floyd-Warshall Algorithm for All-Pairs Shortest Paths
- RO_(36)_Reti_di_flusso.mp4
- RO_(37)_Ripasso_reti_flusso.mp4
- Flow Through Cuts in Networks
- Network Flow Problems and Linear Programming
- Lecture Notes on Matching in Graphs