Publication | Open Access

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

Mathematical ProgrammingBranch-and-bound AlgorithmEngineeringBranch-and-cut AlgorithmTraveling Salesman ProblemCombinatorial ProblemTime WindowsComputational ComplexityComputer ScienceVehicle Routing ProblemDiscrete MathematicsCombinatorial OptimizationDiscrete OptimizationHeuristic SearchInteger ProgrammingOperations Research