We address a generalization of the asymmetric Traveling Salesman Problem where routes have to be constructed to satisfy customer requests, which either involve the pickup or delivery of a single commodity. A vehicle is to be routed such that the demand and the supply of the customers is...

Bernard Gendron and Operations Research -- Methodological Developments -- Variable Neighbourhood Search with Dynamic Exploration for the Set Union Knapsack Problem -- Common-Flow Formulations for the Diameter Constrained Spanning Tree Problem -- Models and Methods for Two-Level Uncapacitated...