Achieving feasibility for clustered traveling salesman problems using PQ‐trees
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The traveling salesman problemDiscrete Optimization, 2006
- Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman ProblemAlgorithmica, 2000
- A -approximation algorithm for the clustered traveling salesman tour and path problemsOperations Research Letters, 1999
- A Genetic Algorithm for the Clustered Traveling Salesman Problem with a Prespecified Order on the Clusters1998
- Analysis of Christofides' heuristic: Some paths are more difficult than cyclesOperations Research Letters, 1991
- Procedures for travelling salesman problems with additional constraintsEuropean Journal of Operational Research, 1979
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Approximation algorithms for some routing problems1976
- The clustered traveling salesman problemComputers & Operations Research, 1975
- A structure theorem for the consecutive 1's propertyJournal of Combinatorial Theory, Series B, 1972