Follow
Laurent Poirrier
Laurent Poirrier
Research Assistant Professor, Combinatorics and Optimization, University of Waterloo
Verified email at uwaterloo.ca - Homepage
Title
Cited by
Cited by
Year
Three-dimensional stable matching with cyclic preferences
K Pashkovich, L Poirrier
Optimization Letters 14 (8), 2615-2623, 2020
202020
The strength of multi-row models
Q Louveaux, L Poirrier, D Salvagnin
Mathematical Programming Computation 7 (2), 113-148, 2015
192015
An algorithm for the separation of two-row cuts
Q Louveaux, L Poirrier
Mathematical Programming 143 (1-2), 111-146, 2014
162014
The (not so) trivial lifting in two dimensions
R Fukasawa, L Poirrier, AS Xavier
Mathematical Programming Computation 11, 211-235, 2019
102019
Multi-row approaches to cutting plane generation
L Poirrier
ULičge-Université de Ličge, 2012
82012
Gemvid, an open source, modular, automated activity recording system for rats using digital video
JE Poirrier, L Poirrier, P Leprince, P Maquet
Journal of Circadian Rhythms 4, 1-10, 2006
72006
The aggregation closure is polyhedral for packing and covering integer programs
K Pashkovich, L Poirrier, H Pulyassary
Mathematical Programming, 1-13, 2022
62022
Numerically safe lower bounds for the Capacitated Vehicle Routing Problem
R Fukasawa, L Poirrier
INFORMS Journal on Computing 29 (3), 544-557, 2017
32017
Multirow intersection cuts based on the infinity norm
ÁS Xavier, R Fukasawa, L Poirrier
INFORMS Journal on Computing 33 (4), 1624-1643, 2021
22021
Split cuts from sparse disjunctions
R Fukasawa, L Poirrier, S Yang
Mathematical Programming Computation 12, 295-335, 2020
22020
Permutations in the factorization of simplex bases
R Fukasawa, L Poirrier
INFORMS Journal on Computing 31 (3), 612-632, 2019
22019
Intersection cuts for single row corner relaxations
R Fukasawa, L Poirrier, AS Xavier
Mathematical Programming Computation 10, 423-455, 2018
22018
On the depth of cutting planes
L Poirrier, J Yu
arXiv preprint arXiv:1903.05304, 2019
12019
A computational survey of best-case gap closure for various relaxations
Q Louveaux, L Poirrier
gen 100 (100), 100, 2010
12010
An efficient space partitioning technique based on linear kd-trees for simulation of short-range interactions in particle methods
L Poirrier
12009
An algorithm for the separation of two-row cuts
L Poirrier
2010
Numerically safe lower bounds for the Capacitated Vehicle Routing Problem
L Poirrier
Simulation d’interactions dynamiques
L Poirrier
Facets of the bound-relaxed two-integer knapsack
R Fukasawa, L Poirrier, A Xavier
The system can't perform the operation now. Try again later.
Articles 1–19