Combinatorial optimization (14h)

This course approaches several aspect of mathematical programming:

• Design of linear formulations
• Relaxation
• Polyhedron and polytope
• Valid and strong valid inequalities
• Branch and bound algorithms
• Gomory cuts and cutting plane algorithms

Teaching types:

• Seminar

Teaching duties:

• Design personal project subjects
• Design seminar exercises
• Exam correction
• Exam design
• Material writing
• Oral examination
• Personal projects correction