Deterministic “Snakes and Ladders” Heuristic for the Hamiltonian cycle problem
- 28 September 2013
- journal article
- Published by Springer Nature in Mathematical Programming Computation
- Vol. 6 (1) , 55-75
Abstract
No abstract availableKeywords
All Related Versions
This publication has 9 references indexed in Scilit:
- The Traveling Salesman Problem2011
- The Traveling Salesman Problem for Cubic Graphs2003
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- Models of Random Regular Graphs1999
- The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization.Journal of the Operational Research Society, 1986
- Graphs with exactly one hamiltonian circuitJournal of Graph Theory, 1977
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait ColorableThe American Mathematical Monthly, 1975
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965
- The Traveling-Salesman ProblemOperations Research, 1956