A branch-and-cut algorithm for the generalized traveling salesman problem with time windows

Yuan Yuan (1) , Diego Cattaruzza (1) , Maxime Ogier (1) , Frédéric Semet (1)

1 INOCS - Integrated Optimization with Complex Structure

Mots clés: generalized traveling salesman problem; time windows; branch-and-cut

Domaines: Recherche opérationnelle [math.OC]

Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Frédéric Semet. A branch-and-cut algorithm for the generalized traveling salesman problem with time windows. OR 2018 - International Conference on Operations Research, Sep 2018, Brussels, Belgium. ⟨hal-01941124⟩