Hamiltonian cycle curves in the space of discounted occupational measures

DOI10.1007/s10479-015-2030-2zbMath1503.05073OpenAlexW2186792808MaRDI QIDQ2095221

Jerzy A. 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

Hamiltonian cycleMarkov decision processregular graphChebyshev polynomialoccupational measure

Mathematics Subject Classification ID

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

Related Items (2)

Identification of unidentified equality constraints for integer programming problems ⋮ On the fastest finite Markov processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On transition matrices of Markov chains corresponding to Hamiltonian cycles
• An efficient algorithm for the Knight's tour problem
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• A note on the graph's resolvent and the multifilar structure
• Clustering of spectra and fractals of regular graphs
• DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
• An algorithm for finding Hamilton paths and cycles in random graphs
• An extension of the multi-path algorithm for finding Hamilton cycles
• Hamiltonian circuits in random graphs
• An interior point heuristic for the Hamiltonian cycle problem via Markov decision processes
• Constrained Discounted Markov Decision Processes and Hamiltonian Cycles
• Hamiltonian Cycles, Random Walks, and Discounted Occupational Measures
• On the Hamiltonicity Gap and doubly stochastic matrices
• Proof of the Hamiltonicity-Trace Conjecture for Singularly Perturbed Markov Chains
• Markov Chains and Optimality of the Hamiltonian Cycle
• Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem
• Determinants and Longest Cycles of Graphs
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Almost all regular graphs are hamiltonian
• Hamiltonian Cycles and Markov Chains
• Finding hidden hamiltonian cycles
• Controlled Markov Chains, Graphs, and Hamiltonicity
• Hamiltonian Cycles and Singularly Perturbed Markov Chains

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