An algorithm for the separation of two-row cuts Q Louveaux, L Poirrier Mathematical Programming 143 (1-2), 111-146, 2014 | 15 | 2014 |

The strength of multi-row models Q Louveaux, L Poirrier, D Salvagnin Mathematical Programming Computation 7 (2), 113-148, 2015 | 13 | 2015 |

Multi-row approaches to cutting plane generation L Poirrier University of Liege, Liege, Belgium, 2012 | 7 | 2012 |

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 | 7 | 2006 |

The aggregation closure is polyhedral for packing and covering integer programs K Pashkovich, L Poirrier, H Pulyassary arXiv preprint arXiv:1910.03404, 2019 | 5 | 2019 |

The (not so) trivial lifting in two dimensions R Fukasawa, L Poirrier, AS Xavier Mathematical Programming Computation 11 (2), 211-235, 2019 | 3 | 2019 |

Permutations in the factorization of simplex bases R Fukasawa, L Poirrier INFORMS Journal on Computing 31 (3), 612-632, 2019 | 2 | 2019 |

Intersection cuts for single row corner relaxations R Fukasawa, L Poirrier, AS Xavier Mathematical Programming Computation 10 (3), 423-455, 2018 | 2 | 2018 |

Numerically safe lower bounds for the Capacitated Vehicle Routing Problem R Fukasawa, L Poirrier INFORMS Journal on Computing 29 (3), 544-557, 2017 | 2 | 2017 |

Three-dimensional stable matching with cyclic preferences K Pashkovich, L Poirrier Optimization Letters, 1-9, 2020 | 1 | 2020 |

Split cuts from sparse disjunctions R Fukasawa, L Poirrier, S Yang Mathematical Programming Computation, 1-41, 2020 | 1 | 2020 |

A computational survey of best-case gap closure for various relaxations Q Louveaux, L Poirrier gen 100 (100), 100, 2010 | 1 | 2010 |

Multi-Row Intersection Cuts based on the Infinity Norm AS Xavier, R Fukasawa, L Poirrier | | 2019 |

On the depth of cutting planes L Poirrier, J Yu arXiv preprint arXiv:1903.05304, 2019 | | 2019 |

An algorithm for the separation of two-row cuts L Poirrier | | 2010 |

An efficient space partitioning technique based on linear kd-trees for simulation of short-range interactions in particle methods L Poirrier | | 2009 |

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 | | |