A successful algorithm for solving directed Hamiltonian path problems
From MaRDI portal
Publication:788642
DOI10.1016/0167-6377(84)90069-5zbMath0531.90092MaRDI QIDQ788642
Gerald L. Thompson, Sharad Singhal
Publication date: 1984
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(84)90069-5
ramification index; Hamiltonian path; spanning arborescences; Computational experience; graph-theoretic polynomial algorithm
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C35: Extremal problems in graph theory
05C38: Paths and cycles
Related Items
A successful algorithm for the undirected Hamiltonian path problem, A randomized parallel branch-and-bound algorithm
Cites Work
- A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Topological design of centralized computer networks—formulations and algorithms
- Hamiltonian Tours and Paths in Rectangular Lattice Graphs
- Algorithms for Large-scale Travelling Salesman Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item