A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Frédéric Semet
Topics & Concepts
Travelling salesman problemVertex (graph theory)Branch and cutHeuristicTime complexityInteger programmingMathematicsBottleneck traveling salesman problemAlgorithmComputer scienceComputationUpper and lower boundsMathematical optimizationInteger (computer science)Window (computing)CombinatoricsGraphOperating systemMathematical analysisProgramming languageVehicle Routing Optimization MethodsFacility Location and Emergency ManagementTransportation and Mobility Innovations