The traveling salesman problem on grids with forbidden neighborhoods
- 24 February 2017
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 34 (3) , 891-915
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Not being (super)thin or solid is hard: A study of grid HamiltonicityComputational Geometry, 2009
- Optimal algorithms for constructing knight's tours on arbitrary n×m chessboardsDiscrete Applied Mathematics, 2005
- New Approximation Results for the Maximum Scatter TSPAlgorithmica, 2004
- On the Maximum Scatter Traveling Salesperson ProblemSIAM Journal on Computing, 1999
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- Proof verification and the hardness of approximation problemsJournal of the ACM, 1998
- An efficient algorithm for the Knight's tour problemDiscrete Applied Mathematics, 1997
- Solution of the knight's Hamiltonian path problem on chessboardsDiscrete Applied Mathematics, 1994
- Which Rectangular Chessboards Have a Knight's Tour?Mathematics Magazine, 1991
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977