Open AccessA branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Author(s) -
Yuan Yuan,
Diego Cattaruzza,
Maxime Ogier,
Frédéric Semet
Publication year - 2018
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - travelling salesman problem , traveling purchaser problem , computer science , bottleneck traveling salesman problem , 2 opt , algorithm , mathematical optimization , mathematics