521 citations · 598 across the 18 of their papers we have counts for
20 papers
Lower Bound of 22 for 3x3 Matrix Multiplication over the Integers
Isaac Rudich, Louis-Martin Rousseau
Strassen showed that two 2x2 matrices can be multiplied with 7 multiplications instead of 8. Applied recursively, his algorithm multiplies two nxn matrices with O(n^2.807) multipli…
Implicit Decision Diagrams
Isaac Rudich, Louis-Martin Rousseau
Decision Diagrams (DDs) have emerged as a powerful tool for discrete optimization, with rapidly growing adoption. DDs are directed acyclic layered graphs; restricted DDs are a gene…
Chance-constrained battery management strategies for the electric bus scheduling problem
Léa Ricard, Guy Desaulniers, Andrea Lodi +1
The global transition to battery electric buses (EBs) presents an opportunity to reduce air and noise pollution in urban areas. However, the adoption of EBs introduces challenges r…
A New Class of Compact Formulations for Vehicle Routing Problems
Udayan Mandal, Amelia Regan, Louis Martin Rousseau +1
This paper introduces a novel compact mixed integer linear programming (MILP) formulation and a discretization discovery-based solution approach for the Vehicle Routing Problem wit…
Notification Timing for On-Demand Personnel Scheduling
Prakash Gawas, Antoine Legrain, Louis-Martin Rousseau
Modern business models have enabled service systems to leverage a large pool of casual employees with flexible hours, paid based on piece rates, to fulfill on-demand work. These sy…
Graph Master and Local Area Routes for Efficient Column Generation for the Capacitated Vehicle Routing Problem with Time Windows
Udayan Mandal, Amelia Regan, Louis Martin Rousseau +1
In this research we consider the problem of accelerating the convergence of column generation (CG) for the weighted set cover formulation of the capacitated vehicle routing problem…