Hamiltonian cycle curves in the space of discounted occupational measures

DOI10.1007/S10479-015-2030-2MaRDI QIDQ2095221zbMATH OpenOpenAlexFDO

Authors Jerzy Filar, Asghar Moeini

Publication date 9 November 2022

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-015-2030-2

zbMATH Keywords

Chebyshev polynomialHamiltonian cycleMarkov decision processoccupational measureregular graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Eulerian and Hamiltonian graphs (05C45) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Programming involving graphs or networks (90C35) Markov and semi-Markov decision processes (90C40)

Recommendations

• Hamiltonian cycles and subsets of discounted occupational measures
• Hamiltonian cycles, random walks, and discounted occupational measures
• Markov chains, Hamiltonian cycles and volumes of convex bodies
• Hamiltonian Cycles and Markov Chains
• Hamiltonian Cycles and Singularly Perturbed Markov Chains

Cites work

• A non-standard branch and bound method for the Hamiltonian cycle problem
• A note on the graph's resolvent and the multifilar structure
• Almost all regular graphs are hamiltonian
• An algorithm for finding Hamilton paths and cycles in random graphs
• An efficient algorithm for the Knight's tour problem
• An extension of the multi-path algorithm for finding Hamilton cycles
• An interior point heuristic for the Hamiltonian cycle problem via Markov decision processes
• Clustering of spectra and fractals of regular graphs
• Constrained discounted Markov decision processes and Hamiltonian cycles.
• Controlled Markov Chains, Graphs, and Hamiltonicity
• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
• Determinants and Longest Cycles of Graphs
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• Finding hidden hamiltonian cycles
• Hamiltonian circuits in random graphs
• Hamiltonian Cycles and Markov Chains
• Hamiltonian Cycles and Singularly Perturbed Markov Chains
• Hamiltonian cycles, random walks, and discounted occupational measures
• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 682567 (Why is no real title available?)
• scientific article; zbMATH DE number 855063 (Why is no real title available?)
• Markov chains and optimality of the Hamiltonian cycle
• On the Hamiltonicity gap and doubly stochastic matrices
• On transition matrices of Markov chains corresponding to Hamiltonian cycles
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Proof of the hamiltonicity-trace conjecture for singularly perturbed Markov chains
• Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem
• The Planar Hamiltonian Circuit Problem is NP-Complete

Cited in

(4)

• Identification of unidentified equality constraints for integer programming problems
• On the fastest finite Markov processes
• Hamiltonian cycles, random walks, and discounted occupational measures
• Hamiltonian cycles and subsets of discounted occupational measures

This page was built for publication: Hamiltonian cycle curves in the space of discounted occupational measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095221)