Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem
From MaRDI portal
Recommendations
- A non-standard branch and bound method for the Hamiltonian cycle problem
- An interior point heuristic for the Hamiltonian cycle problem via Markov decision processes
- Hamiltonian cycle problem and Markov chains.
- Markov chains and optimality of the Hamiltonian cycle
- Constrained discounted Markov decision processes and Hamiltonian cycles.
Cited in
(10)- 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
- Adaptation of a branching algorithm to solve the multi-objective Hamiltonian cycle problem
- A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
- A non-standard branch and bound method for the Hamiltonian cycle problem
- Markov chains, Hamiltonian cycles and volumes of convex bodies
- An interior point heuristic for the Hamiltonian cycle problem via Markov decision processes
- Proof of the hamiltonicity-trace conjecture for singularly perturbed Markov chains
- Hamiltonian cycles and subsets of discounted occupational measures
This page was built for publication: Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3169065)