Constraint Programming Techniques for Mixed Integer Linear Programs

ARGOMENTI: Seminars Ph.D. Program

Wednesday 8 April 2009 h. 15:00, room 1A/150
Domenico SALVAGNIN (Ph.D. in Applied Math., Dip. Mat.)
"Constraint Programming Techniques for Mixed Integer Linear Programs"

Two paradigms in the field of optimization have reached a high degree of sophistication from the point of view of both theory and implementation: Constraint Programmming (CP) and Mixed Integer Programming (MIP). The CP and MIP paradigms have strengths and weaknesses that complement each other: thus an integration of the two has the potential to yield important benefits. In this talk I will provide a brief introduction of the two paradigms and present two cases of application of CP techniques, namely nogoods and propagation, to enhance MIP resolution algorithms, namely dominance detection and primal heuristics.

Rif. int. C. Marastoni, T. Vargiolu, M. Dalla Riva

Download Seminario Dottorato