Online Didactic Material for course "Optimisation Models and Algorithms"
Here you can find the complete list of the course material available online.
Description  Date  Size  Type  

Main folder 

Course summary
Summary of lectures hold in a.y. 201819, English 
22 dic 2018  78KB  
00GraphsGraphs: basic definitions and properties 

0Graphs
Graphs: definitions and basic properties 
15 nov 2016  790KB  
01Problem GalleryCombinatorial Optimization: a gallery of famous problems 

1.201LP
Linearization techniques in 01 LP 
12 giu 2019  528KB  
1.1StableSetExercise
Alternative formulations for the Stable Set Problem 
24 ott 2017  298KB  
1.0Homework
Formulating combinatorial optimization problems as 01 LP 
24 ott 2017  215KB  
1Problem Gallery
Combinatorial Optimization: a gallery of famous problems 
15 nov 2016  4821KB  
02ComplexityElements of complexity theory 

2Complexity
Elements of complexity theory 
15 nov 2016  732KB  
03UnimodularityTotally unimodular matrices 

3Unimodularity
Totally unimodular matrices 
15 nov 2016  424KB  
04CutsCuts in a graph. The max cut problem: a combinatorial algorithm for line graphs; VLSI circuit layout 

4.2VLSI Layout
Models for VLSI circuit layout: PLA folding 
24 ott 2017  1255KB  
4.1MaxCut
The max cut problem: the case of line graphs 
15 nov 2016  660KB  
05Dynamic ProgrammingDirected acyclic graphs, topological ranking, dynamic programming, applications 

5.201 knapsack
A pseudopolinomialtime algorithm for 01 Knapsack 
16 nov 2016  217KB  
5.1Dynamic Programming
Directed acyclic graphs, topological ranking, dynamic programming, applications 
16 nov 2016  2561KB  
07MatroidsMatroids and the Greedy method 

7.1Matroids
Matroids and the Greedy Method, Rado's Theorem, examples 
17 nov 2016  564KB  
06DualityDuality in linear programming 

6.5Murphy
Murphy's Law: zerosum games 
16 nov 2016  212KB  
6.4Dijkstra
Dijkstra algorithm for the shortest path problem, reinterpreted as a primaldual method 
16 nov 2016  651KB  
6.3PrimalDual
The PrimalDual Method 
16 nov 2016  651KB  
6.2Duality
Duality in Linear Programming: theorems of the alternative, strong and weak duality, examples 
16 nov 2016  245KB  
6.1Projections
Projecting a convex poyhedron, FourierVeronese's Theorem, FourierMotzkin Algorithm 
16 nov 2016  979KB  
09MatchingMatching and relations to edgecover, stable and trnasversal set. Solving (un)weighted bipartite matching 

09Matching
Matching and relation to edgecover, stable and transversal set. Solving (un)weighted bipartite matching 
16 nov 2016  994KB  
08ApproximationGuaranteed approximation methods: metric TSP, 01 Knapsack 

08Approximation
Guaranteed approximation methods: metric TSP, 01 Knapsack 
16 nov 2016  643KB  
13Problems and solutionsprevious tests: texts and answer keys 

answer key to written test  Feb 19th, 2019
answer key to written test of Feb 19th, 2019, English 
23 feb 2019  204KB  
written test  Feb 19th, 2019
Written test of Feb 19th, 2019  without solution, English 
23 feb 2019  127KB  
answer key to written test  Feb 5th, 2019
answer key to written test  Feb 5th, 2019, English version 
07 feb 2019  167KB  
written test  Feb 5th, 2019
written test  Feb 5th, 2019, problem text only, English version 
06 feb 2019  138KB  
answer key to written test  Jan 22nd, 2019
answer key to written test of Jan 22nd, 2019  English version 
23 gen 2019  198KB  
written test  Jan 22nd, 2019
written test, Jan 22nd 2019  English version, problems proposed 
23 gen 2019  151KB  
answer key to midterm test  November 9, 2017
answer key to midterm test  November 9, 2017  English version 
15 nov 2017  165KB  
midterm test of November 9, 2017
midterm test of November 9, 2017, text only  Italian version 
15 nov 2017  139KB  
midterm test of November 9, 2017
midterm test of November 9, 2017, text only  English version 
15 nov 2017  134KB  
Problems and solutions
Four exercises, their solution and a reflection 
10 nov 2017  464KB  
answer key to written test  January 23rd, 2017
solutions to proposed exercises 
02 feb 2017  267KB  
written test  July 8th, 2015

24 gen 2017  148KB  
written test  January 23rd, 2017
text only 
24 gen 2017  195KB  
written test  May 12th, 2015  group B

24 gen 2017  117KB  
written test  May 12th, 2015  group A

24 gen 2017  116KB  
answer key to written test  November 21st, 2016
answer key to written test  November 21st, 2016 
23 nov 2016  157KB  
written test  November 21st, 2016
written test  November 21st, 2016  text only 
23 nov 2016  136KB  
answer key to written test  July 8th, 2015
claudio.arbib 
17 nov 2016  286KB  
answer key to written test  January 26th, 2016

17 nov 2016  182KB  
answer key to written test  April 23rd, 2014
claudio.arbib 
17 nov 2016  151KB  
answer key to written test  February 17th, 2016

17 nov 2016  336KB  
answer key to written test  November 12th, 2015

17 nov 2016  185KB  
written test  November 26th, 2016

17 nov 2016  200KB  
written test  February 18th, 2016

17 nov 2016  233KB  
written test  November 12th, 2015

17 nov 2016  132KB  
10BranchandboundImplicit enumeration methods 

10Branchandbound
Implicit enumeration methods for integer linear programming, use of bounds, examples 
17 nov 2016  1467KB  
11Column GenerationHow to solve LPs with many columns. Example: the Cutting Stock Problem 

11Cutting Stock
Cutting stock: industrial applications, models and algorithms 
20 dic 2016  468KB  
12Convex optimizationConvex sets and functions, problems, duality 

12.5Duality
Duality theory in convex optimization 
10 nov 2017  115KB  
12.4Problems
Convex optimization problems 
10 nov 2017  207KB  
12.3Convex functions
General properties of convex functions 
10 nov 2017  160KB  
12.2Convex sets
General properties of convex sets 
10 nov 2017  142KB  
12.1Introduction
Introduction to convex optimization 
10 nov 2017  61KB 