HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle

DOI10.1155/2018/9328103zbMath1460.05182OpenAlexW2896581360MaRDI QIDQ1722882

K. R. Seeja

Publication date: 18 February 2019

Published in: Journal of Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2018/9328103

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Uses Software

• LKH

Cites Work

• Unnamed Item
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• New sufficient conditions for cycles in graphs
• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
• An algorithm for finding Hamilton paths and cycles in random graphs
• An extension of the multi-path algorithm for finding Hamilton cycles
• Hamiltonian circuits in random graphs
• Advances on the Hamiltonian problem -- a survey
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Solving the Hamiltonian cycle problem using symbolic determinants
• Note on Hamilton Circuits
• An algorithm for finding hamilton cycles in random directed graphs
• A Search Procedure for Hamilton Paths and Circuits
• Finding hidden hamiltonian cycles
• Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph
• FHCP Challenge Set: The First Set of Structurally Difficult Instances of the Hamiltonian Cycle Problem
• The Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Some Theorems on Abstract Graphs

This page was built for publication: HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle