On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem
- 1 March 1982
- Vol. 12 (1) , 23-39
- https://doi.org/10.1002/net.3230120103
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Tight bounds for christofides' traveling salesman heuristicMathematical Programming, 1978
- Heuristic for the Asymmetric Travelling Salesman ProblemJournal of the Operational Research Society, 1978
- An Analysis of the Greedy Heuristic for Independence SystemsAnnals of Discrete Mathematics, 1978
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- Matroids and the greedy algorithmMathematical Programming, 1971
- Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of CitiesJournal of the Operational Research Society, 1971
- A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling ProblemsIMA Journal of Applied Mathematics, 1967
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- Scheduling of Vehicles from a Central Depot to a Number of Delivery PointsOperations Research, 1964
- A Heuristic Approach to Solving Travelling Salesman ProblemsManagement Science, 1964