product iamge

Controlled Markov chains, graphs, and Hamiltonicity

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Controlled Markov Chains, Graphs & Hamiltonicity summarizes a line of research that maps certain classical problems of discrete mathematics - such as the Hamiltonian cycle and the Traveling Salesman problems - into convex domains where continuum analysis can be carried out.

Author(s): Jerzy A. Filar
Series: Foundations and Trends
Edition: Now
Publisher: Now Publishers Inc
Year: 2007

Language: English
Pages: 96

Contents......Page 10
Introduction......Page 12
A Graph and A Markov Decision Process......Page 16
Perturbed Embedding......Page 21
Background from Markov Chains and MDPs......Page 25
HCP and Minimal Variance of Hitting Times......Page 30
Determinant of the Inverse of Fundamental Matrix......Page 45
HCP in the Frequency Space of the Long-Run Average MDP......Page 50
An Interior-Point Method in Frequency Space......Page 58
HCP in the Frequency Space of the Discounted MDP......Page 67
Branch and Fix Methods in the Frequency Space......Page 71
A Fast Heuristic......Page 75
Introduction......Page 78
Fractal-like Structure of Regular Graphs......Page 80
Conclusions and Some Speculative Comments......Page 85
Acknowledgments......Page 90
References......Page 92