A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
From MaRDI portal
Recommendations
- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
- An interior point heuristic for the Hamiltonian cycle problem via Markov decision processes
- scientific article; zbMATH DE number 1560329
- Hamiltonian cycle problem and Markov chains.
- An algorithm for finding Hamilton paths and cycles in random graphs
Cites work
- scientific article; zbMATH DE number 1220657 (Why is no real title available?)
- scientific article; zbMATH DE number 1134975 (Why is no real title available?)
- scientific article; zbMATH DE number 2005717 (Why is no real title available?)
- scientific article; zbMATH DE number 2117227 (Why is no real title available?)
- scientific article; zbMATH DE number 5685899 (Why is no real title available?)
- scientific article; zbMATH DE number 3322635 (Why is no real title available?)
- An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
- Constrained discounted Markov decision processes and Hamiltonian cycles.
- Controlled Markov Chains, Graphs, and Hamiltonicity
- Convergence properties of the cross-entropy method for discrete optimization
- Determinants and Longest Cycles of Graphs
- Hamiltonian Cycles and Markov Chains
- On the convergence of the cross-entropy method
- Optimization of computer simulation models with rare events
- Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem
- The cross-entropy method for combinatorial and continuous optimization
Cited in
(11)- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
- Incremental SAT-based method with native Boolean cardinality handling for the Hamiltonian cycle problem
- Feasible Bases for a Polytope Related to the Hamilton Cycle Problem
- On transition matrices of Markov chains corresponding to Hamiltonian cycles
- Adaptation of a branching algorithm to solve the multi-objective Hamiltonian cycle problem
- A new heuristic for detecting non-Hamiltonicity in cubic graphs
- Finding Hamiltonian cycles using an interior point method
- Markov chains, Hamiltonian cycles and volumes of convex bodies
- Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
- An effective algorithm for and phase transitions of the directed Hamiltonian cycle problem
- Hamiltonian cycles and subsets of discounted occupational measures
This page was built for publication: A hybrid simulation-optimization 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 Q666352)
