Results for the close-enough traveling salesman problem with a branch-and-bound algorithm
Wenda Zhang, Jason J. Sauppe, Sheldon H. Jacobson
Topics & Concepts
Travelling salesman problemMathematical optimization2-optMathematicsBottleneck traveling salesman problemBranch and boundGeneralizationAlgorithmVertex (graph theory)ComputationSpace (punctuation)Christofides algorithmComputer scienceGraphCombinatoricsMathematical analysisOperating systemVehicle Routing Optimization MethodsScheduling and Timetabling SolutionsOptimization and Packing Problems