Geometric interpretation of Hamiltonian cycles problem via singularly perturbed Markov decision processes
From MaRDI portal
Publication:4467171
DOI10.1080/02331930310001611529zbMath1043.05071OpenAlexW2056802749MaRDI QIDQ4467171
Jane Thredgold, Vladimir V. Ežov, Jerzy A. Filar
Publication date: 9 June 2004
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930310001611529
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Markov and semi-Markov decision processes (90C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient algorithm for the Knight's tour problem
- Constrained Discounted Markov Decision Processes and Hamiltonian Cycles
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Almost all regular graphs are hamiltonian
- Hamiltonian Cycles and Markov Chains
This page was built for publication: Geometric interpretation of Hamiltonian cycles problem via singularly perturbed Markov decision processes