Publication | Closed Access
Small and large TSP: Two polynomially solvable cases of the traveling salesman problem
17
Citations
6
References
1993
Year
Mathematical ProgrammingEngineeringLocal Search (Optimization)Solvable CasesLarge TspTraveling Salesman ProblemCombinatorial ProblemComputational ComplexityComputer ScienceSalesman ProblemDiscrete MathematicsVehicle Routing ProblemCombinatorial OptimizationDiscrete OptimizationHeuristic SearchOperations Research
| Year | Citations | |
|---|---|---|
Page 1
Page 1