M614

Mixed-Integer optimization represents a powerful tool for modeling many optimization problems arising from real-world applications. We study and propose different continuous reformulation for mixed zero-one programming problems. We prove that, under suitable conditions, the optimal solutions of a zero-one programming problem can be obtained by solving a specific continuous problem. Furthermore we use these reformulation in practice for finding a first feasible solution for hard MIP problems. Numerical results are presented.

Oberseminar Diskrete Optimierung

Marianna De Santis

Universität La Sapienza, Rom