Publication | Closed Access

The double traveling salesman problem with multiple stacks: A variable neighborhood search approach

Mathematical ProgrammingMultiple StacksEngineeringTraveling Salesman ProblemCombinatorial ProblemComputer ScienceSalesman ProblemDiscrete MathematicsVehicle Routing ProblemCombinatorial OptimizationHeuristic SearchVariable Neighborhood SearchOperations Research