TSP tour domination and Hamilton cycle decompositions of regular digraphs
- 1 April 2001
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 28 (3) , 107-111
- https://doi.org/10.1016/s0167-6377(01)00053-0
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination numberDiscrete Applied Mathematics, 2002
- Construction heuristics for the asymmetric TSPEuropean Journal of Operational Research, 2001
- The traveling salesman problem: new polynomial approximation algorithms and domination analysisJournal of Information and Optimization Sciences, 2001
- 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
- The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithmsJournal of the Operational Research Society, 1997
- A new heuristic for the traveling salesman problemRairo-Operations Research, 1990
- Decomposition into Cycles I: Hamilton DecompositionsPublished by Springer Nature ,1990
- A Hamiltonian decomposition of K2m∗, 2m ≥ 8Journal of Combinatorial Theory, Series B, 1980