Andere Kunden interessierten sich auch für
![Markov Chain Models for Stochastic Shortest Path Problem]( "Markov Chain Models for Stochastic Shortest Path Problem")
Markov Chain Models for Stochastic Shortest Path Problem23,99 €![Some new theorems of Markov Models from the originating Chain measure]( "Some new theorems of Markov Models from the originating Chain measure")
Some new theorems of Markov Models from the originating Chain measure39,99 €![Markov Chain Aggregation for Agent-Based Models]( "Markov Chain Aggregation for Agent-Based Models")
Markov Chain Aggregation for Agent-Based Models55,99 €![Markov chain]( "Markov chain")
Markov chain22,99 €![Markov Chain Monte Carlo in Practice]( "Markov Chain Monte Carlo in Practice")
Markov Chain Monte Carlo in Practice59,99 €![Efficient deterministic algorithms for finding optimal cycle bases]( "Efficient deterministic algorithms for finding optimal cycle bases")
Efficient deterministic algorithms for finding optimal cycle bases30,99 €![Hamiltonian Cycles and the Space of Discounted Occupational Measures]( "Hamiltonian Cycles and the Space of Discounted Occupational Measures")
Hamiltonian Cycles and the Space of Discounted Occupational Measures44,99 €
In 1992, it was demonstrated that the Hamiltonian cycle problem (HCP) may be embedded in a Markov decision process (MDP). This breakthrough enabled a number of new theoretical and algorithmic developments for HCP. In particular, optimisation models which are equivalent to HCP were constructed. However, the development of numerical procedures based on these models has lagged the rapid development of new theory. In this monograph, we progress a number of new algorithmic approaches that take advantage of the MDP perspective. The work presented within is separated into three primary chapters, each describing a different algorithmic approach to solving HCP.