Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
- 1 June 2002
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 119 (1-2) , 107-116
- https://doi.org/10.1016/s0166-218x(01)00267-0
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Construction heuristics for the asymmetric TSPEuropean Journal of Operational Research, 2001
- 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
- Ejection chains, reference structures and alternating path methods for traveling salesman problemsDiscrete Applied Mathematics, 1996
- A new heuristic for the traveling salesman problemRairo-Operations Research, 1990
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- A Hamiltonian decomposition of K2m∗, 2m ≥ 8Journal of Combinatorial Theory, Series B, 1980