Publication | Closed Access
The Euclidean travelling salesman problem is NP-complete
765
Citations
8
References
1977
Year
Mathematical ProgrammingEngineeringGraph TheoryTraveling Salesman ProblemCombinatorial ProblemComputational ComplexityComputer ScienceSalesman ProblemDiscrete MathematicsVehicle Routing ProblemCombinatorial OptimizationDiscrete Optimization
| Year | Citations | |
|---|---|---|
Page 1
Page 1