A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
DOI10.1007/S10479-009-0565-9zbMATH Open1233.90270OpenAlexW2070593991MaRDI QIDQ666352FDOQ666352
Ali Eshragh, Michael Haythorpe, Jerzy Filar
Publication date: 8 March 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0565-9
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
Programming involving graphs or networks (90C35) Optimality conditions and duality in mathematical programming (90C46) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Optimization of computer simulation models with rare events
- The cross-entropy method for combinatorial and continuous optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence properties of the cross-entropy method for discrete optimization
- Constrained discounted Markov decision processes and Hamiltonian cycles.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamiltonian Cycles and Markov Chains
- Controlled Markov Chains, Graphs, and Hamiltonicity
- An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
- Title not available (Why is that?)
- On the convergence of the cross-entropy method
- Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem
- Determinants and Longest Cycles of Graphs
Cited In (8)
- 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
- Hamiltonian Cycles and Subsets of Discounted Occupational Measures
- Adaptation of a branching algorithm to solve the multi-objective Hamiltonian cycle problem
- A new heuristic for detecting non-Hamiltonicity in cubic graphs
- Markov chains, Hamiltonian cycles and volumes of convex bodies
- Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
Uses Software
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)
