Mathieu Van Vyve

Learn More
Acknowledgments I would like to express my gratitude to my two supervisors, Yves Pochet and Laurence Wolsey. It is difficult to imagine somebody more available for discussion than Yves Pochet. Even when he was crumbling under administrative work, he always had time to spend for discussing my work in progress. Laurence Wolsey have been a continuous source of(More)
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involving new variables is a possible alternative, but this often results in prohibitively large MIPs where even the linear programming relaxations are hard or impossible to solve. In(More)
We investigate the problem of solving traditional combinatorial graph problems using secure multi-party computation techniques, focusing on the shortest path and the maximum flow problems. To the best of our knowledge, this is the first time these problems have been addressed in a general multi-party computation setting. Our study highlights several(More)
This paper is a polyhedral study of a generalization of the mixing set where two different, divisible coefficients are allowed for the integral variables. Our results generalize earlier work on mixed integer rounding, mixing, and extensions. They also directly apply to applications such as production planning problems involving lower bounds or start-ups on(More)