LAURENT POIRRIER
Courses a.y. 2023/2024
20875
SOFTWARE ENGINEERING
Courses previous a.y.
Biographical note
I am an Adjunct Professor in the Computer Science Department of Bocconi University. I obtained my PhD in 2012 from the University of Liège, Belgium. My work focuses on linear and mixed-integer optimization.
Personal website: https://www.poirrier.ca/
Research interests
I work on the computational aspects of discrete optimization. I am also broadly interested in all topics that are relevant to the implementation of fast optimization algorithms, including linear algebra, combinatorics and numerical analysis.
Selected Publications
K. Pashkovich; L. Poirrier; H. Pulyassary
The Aggregation Closure is Polyhedral for Packing and Covering Integer Programs
Mathematical Programming, 2019
The Aggregation Closure is Polyhedral for Packing and Covering Integer Programs
Mathematical Programming, 2019
R. Fukasawa; L. Poirrier
Permutations in the Factorization of Simplex Bases
INFORMS Journal on Computing, 31(3):612-632, 2019
Permutations in the Factorization of Simplex Bases
INFORMS Journal on Computing, 31(3):612-632, 2019
R. Fukasawa; L. Poirrier; A. S. Xavier
The (not so) Trivial Lifting in Two Dimensions
Mathematical Programming Computation, 11(2):211-235, 2019
The (not so) Trivial Lifting in Two Dimensions
Mathematical Programming Computation, 11(2):211-235, 2019
R. Fukasawa; L. Poirrier
Numerically safe lower bounds for the capacitated vehicle routing problem
INFORMS Journal on Computing. 29(3):544-557, 2017
Numerically safe lower bounds for the capacitated vehicle routing problem
INFORMS Journal on Computing. 29(3):544-557, 2017