Publication | Closed Access

Neighborhood search algorithms for guaranteeingoptimal traveling salesman tours must be inefficient

Mathematical ProgrammingHeuristic SearchEngineeringGraph TheoryNeighborhood Search AlgorithmsRoute PlanningTraveling Salesman ProblemComputational ComplexityComputer ScienceVehicle Routing ProblemDiscrete MathematicsCombinatorial OptimizationSalesman ToursVariable Neighborhood SearchOperations Research