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.

About the Author

Dr. Michael Haythorpe completed his PhD in July, 2010 at University of South Australia, Adelaide. His research interests lie in graph theory, complexity, numerical optimisation and algorithm development. He currently holds a research fellow position at Flinders University.

"About this title" may belong to another edition of this title.

Store Description

We carry a wide selection of books from South Asia, United States, UK.

Visit Seller's Storefront

Seller's business information

Readingos GmbH
Kaiserstra�e 47, Frankfurt am Main, 60329, Germany

Sale & Shipping Terms

Terms of Sale

Shipping Terms

To ensure faster delivery, books may be shipped from any of the following locations Germany, the United Kingdom (UK), the United States (US), based on the buyer's address and product availability.

Shipping rates from Germany to U.S.A.

Shipping rates from Germany to U.S.A.
Order quantity	25 to 45 business days	8 to 14 business days
First item	US$ 11.20	US$ 21.04

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.