When the greedy algorithm fails
- 1 November 2004
- journal article
- Published by Elsevier in Discrete Optimization
- Vol. 1 (2), 121-127
- https://doi.org/10.1016/j.disopt.2004.03.007
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- TSP Heuristics: Domination Analysis and ComplexityAlgorithmica, 2003
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination numberDiscrete Applied Mathematics, 2002
- Domination analysis of some heuristics for the traveling salesman problemDiscrete Applied Mathematics, 2002
- Anti-matroidsOperations Research Letters, 2002
- Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSPDiscrete Applied Mathematics, 2002
- The Traveling Salesman Problem with Distances One and TwoMathematics of Operations Research, 1993
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and twoInformation Processing Letters, 1992