Hamiltonian cycle curves in the space of discounted occupational measures
type: Item
instance of: scholarly article
title: Hamiltonian cycle curves in the space of discounted occupational measures
zbMATH Open document ID: 1503.05073
author: Jerzy Filar
author: Asghar Moeini
published in: Annals of Operations Research
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 7614233
zbMATH Keywords: Hamiltonian cycle
zbMATH Keywords: Markov decision process
zbMATH Keywords: occupational measure
zbMATH Keywords: Chebyshev polynomial
zbMATH Keywords: regular graph
MaRDI profile type: Publication
full work available at URL: s10479-015-2030-2
OpenAlex ID: W2186792808
cites work: On transition matrices of Markov chains corresponding to Hamiltonian cycles
cites work: Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem
cites work: An algorithm for finding Hamilton paths and cycles in random graphs
cites work: On the Hamiltonicity Gap and doubly stochastic matrices
cites work: Finding hidden hamiltonian cycles
cites work: DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits
cites work: Q4083324
cites work: An interior point heuristic for the Hamiltonian cycle problem via Markov decision processes
cites work: Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem
cites work: Clustering of spectra and fractals of regular graphs
cites work: Determinants and Longest Cycles of Graphs
cites work: Hamiltonian Cycles and Singularly Perturbed Markov Chains
cites work: A note on the graph's resolvent and the multifilar structure
cites work: Proof of the Hamiltonicity-Trace Conjecture for Singularly Perturbed Markov Chains
cites work: Hamiltonian cycles, random walks, and discounted occupational measures
cites work: Constrained discounted Markov decision processes and Hamiltonian cycles.
cites work: Controlled Markov Chains, Graphs, and Hamiltonicity
cites work: Hamiltonian Cycles and Markov Chains
cites work: A non-standard branch and bound method for the Hamiltonian cycle problem
cites work: The Planar Hamiltonian Circuit Problem is NP-Complete
cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
cites work: An extension of the multi-path algorithm for finding Hamilton cycles
cites work: Q4312266
cites work: Markov Chains and Optimality of the Hamiltonian Cycle
cites work: An efficient algorithm for the Knight's tour problem
cites work: Hamiltonian circuits in random graphs
cites work: Almost all regular graphs are hamiltonian
cites work: Q4869795
DOI: 10.1007/S10479-015-2030-2
description: scientific article; zbMATH DE number 7614233