Date : March 21, 2019, 1 p.m. - Room :Salle du conseil
Fair combinatorial optimization: formulations and algorithms
M. Viet Hung Nguyen, Maître de conférences - LIP6, Département DESIR, Sorbonne Université
In the first part of this talk, modeling the notion of "fairness" in combinatorial optimization is reviewed.
As this results in rather non convex and non linear models, some linearization methods to derive MIP formulations are described in the second part. At last, special purpose algorithms for solving these MIPs are discussed and analyzed with numerical results.