Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem
From MaRDI portal
Publication:3169065
DOI10.1287/moor.1090.0398zbMath1210.90172OpenAlexW2008636632MaRDI QIDQ3169065
Giang T. Nguyen, Michael Haythorpe, Jerzy A. Filar, Vladimir V. Ežov
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2328/26401
Programming involving graphs or networks (90C35) Markov and semi-Markov decision processes (90C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (7)
Markov chains, Hamiltonian cycles and volumes of convex bodies ⋮ Hamiltonian Cycles and Subsets of Discounted Occupational Measures ⋮ A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem ⋮ Proof of the Hamiltonicity-Trace Conjecture for Singularly Perturbed Markov Chains ⋮ On the fastest finite Markov processes ⋮ Hamiltonian cycle curves in the space of discounted occupational measures ⋮ Feasible Bases for a Polytope Related to the Hamilton Cycle Problem
Uses Software
This page was built for publication: Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem