178 citations · 1.1k across the 46 of their papers we have counts for
6 papers · 1 filter
An efficient bundle-based approach for the share-a-ride problem
Ana Beatriz Herthel, Richard Hartl, Anand Subramanian +1
Some of today's most significant challenges in urban environments concern individual mobility and rapid parcel delivery. With the surge of e-commerce and the ever-increasing volume…
Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem
Toni Pacheco, Rafael Martinelli, Anand Subramanian +2
Neighborhood search is a cornerstone of state-of-the-art traveling salesman and vehicle routing metaheuristics. While neighborhood exploration procedures are well developed for pro…
Optimal Counterfactual Explanations in Tree Ensembles
Axel Parmentier, Thibaut Vidal
Counterfactual explanations are usually generated through heuristics that are sensitive to the search's initial conditions. The absence of guarantees of performance and robustness…
Semi-Supervised Clustering with Inaccurate Pairwise Annotations
Daniel Gribel, Michel Gendreau, Thibaut Vidal
Pairwise relational information is a useful way of providing partial supervision in domains where class labels are difficult to acquire. This work presents a clustering model that…
Electric Vehicle Fleets: Scalable Route and Recharge Scheduling through Column Generation
Axel Parmentier, Rafael Martinelli, Thibaut Vidal
The rise of battery-powered vehicles has led to many new technical and methodological hurdles. Among these, the efficient planning of an electric fleet to fulfill passenger transpo…
Community Detection in the Stochastic Block Model by Mixed Integer Programming
Breno Serrano, Thibaut Vidal
The Degree-Corrected Stochastic Block Model (DCSBM) is a popular model to generate random graphs with community structure given an expected degree sequence. The standard approach o…