activity
20192023
most citedOptimising Electric Vehicle Charging Station Placement using Advanced Discrete Choice Models

54 citations · 95 across the 6 of their papers we have counts for

collaborators

6 papers

math.OC2023

On the integration of Dantzig-Wolfe and Fenchel decompositions via directional normalizations

François Lamothe, Alain Haït, Emmanuel Rachelson +2

The strengthening of linear relaxations and bounds of mixed integer linear programs has been an active research topic for decades. Enumeration-based methods for integer programming…

math.OC2023★ 2 cited

A Logistics Provider's Profit Maximization Facility Location Problem with Random Utility Maximizing Followers

David Pinzon, Emma Frejinger, Bernard Gendron

We introduce a strategic decision-making problem faced by logistics providers (LPs) seeking facility location decisions that lead to profitable operations. The profitability depend…

math.OC2022★ 2 cited

Fast Continuous and Integer L-shaped Heuristics Through Supervised Learning

Eric Larsen, Emma Frejinger, Bernard Gendron +1

We propose a methodology at the nexus of operations research and machine learning (ML) leveraging generic approximators available from ML to accelerate the solution of mixed-intege…

math.OC2022★ 54 cited

Optimising Electric Vehicle Charging Station Placement using Advanced Discrete Choice Models

Steven Lamontagne, Margarida Carvalho, Emma Frejinger +3

We present a new model for finding the optimal placement of electric vehicle charging stations across a multi-period time frame so as to maximise electric vehicle adoption. Via the…

math.OC2021★ 6 cited

A Catalog of Formulations for the Network Pricing Problem

Quang Minh Bui, Bernard Gendron, Margarida Carvalho

We study the network pricing problem where the leader maximizes their revenue by determining the optimal amounts of tolls to charge on a set of arcs, under the assumption that the…

cs.DS2019★ 31 cited

Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes

Janniele A. S. Araujo, Haroldo Gambini Santos, Bernard Gendron +3

Resource Constrained Project Scheduling Problems (RCPSPs) without preemption are well-known NP-hard combinatorial optimization problems. A feasible RCPSP solution consists of a tim…