Construction heuristics for the asymmetric TSP
- 16 March 2001
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 129 (3) , 555-568
- https://doi.org/10.1016/s0377-2217(99)00468-3
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The traveling salesman problem:Published by JSTOR ,2018
- Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tourComputers & Operations Research, 1999
- Exponential neighbourhood local search for the traveling salesman problemComputers & Operations Research, 1999
- CONTROLLED ATMOSPHERE STORAGE OF APPLES IN THE UKActa Horticulturae, 1999
- Combinatorial OptimizationPublished by Wiley ,1997
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithmsJournal of the Operational Research Society, 1997
- Implementation of a linear time algorithm for certain generalized traveling salesman problemsPublished by Springer Nature ,1996
- A new heuristic for the traveling salesman problemRairo-Operations Research, 1990
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- The Traveling-Salesman Problem and Minimum Spanning TreesOperations Research, 1970