Hamiltonian Cycle Problem and Markov Chains (International Series in Operations Research & Management Science #171)
by Vivek S. Borkar, Vladimir Ejov, Jerzy A. Filar and Giang T. Nguyen
From $96.79 / copy at 25+ copies; lower per-copy prices at higher quantities (see Volume pricing) As low as $94.59 at 100+
Total $2,419.75
Format
The more copies, the less each one costs
Applied automatically in your cart. No code needed.
Turn this order into a program
Groups that order together often pair the copies with something more. We handle the extras so you don't have to.
Branded cover stickers on paperbacks from 100 copies, plus bookplates, inserts and belly bands. Your specialist confirms what fits your title.
Customization options Ship to every readerOne address, many sites or individual recipients' homes, in the US and abroad.
Fulfillment options Pair it with a branded journalJournals with your logo or each reader's name, for the same group.
Branded journalsBookPal is partnering with Talezo to help you find and book authors, speakers and performers for your event.
BookPal × TalezoHamiltonian Cycle Problem and Markov Chains (International Series in Operations Research & Management Science #171)
This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian Cycle and the Travelling Salesman Problems - into convex domains where continuum analysis can be carried out. Arguably, the inherent difficulty of these, now classical, problems stems precisely from the discrete nature of domains in which these problems are posed. The convexification of domains underpinning these results is achieved by assigning probabilistic interpretation to key elements of the original deterministic problems. In particular, the approaches summarized here build on a technique that embeds Hamiltonian Cycle and Travelling Salesman Problems in a structured singularly perturbed Markov decision process. The unifying idea is to interpret subgraphs traced out by deterministic policies (including Hamiltonian cycles, if any) as extreme points of a convex polyhedron in a space filled with randomized policies.
The above innovative approach has now evolved to the point where there are many, both theoretical and algorithmic, results that exploit the nexus between graph theoretic structures and both probabilistic and algebraic entities of related Markov chains. The latter include moments of first return times, limiting frequencies of visits to nodes, or the spectra of certain matrices traditionally associated with the analysis of Markov chains. However, these results and algorithms are dispersed over many research papers appearing in journals catering to disparate audiences. As a result, the published manuscripts are often written in a very terse manner and use disparate notation, thereby making it difficult for new researchers to make use of the many reported advances.
Hence the main purpose of this book is to present a concise and yet easily accessible synthesis of the majority of the theoretical and algorithmicresults obtained so far. In addition, the book discusses numerous open questions and problems that arise from this body of work and which are yet to be fully solved. The approach casts the Hamiltonian Cycle Problem in a mathematical framework that permits analytical concepts and techniques, not used hitherto in this context, to be brought to bear to further clarify both the underlying difficulty of NP-completeness of this problem and the relative exceptionality of truly difficult instances. Finally, the material is arranged in such a manner that the introductory chapters require very little mathematical background and discuss instances of graphs with interesting structures that motivated a lot of the research in this topic. More difficult results are introduced later and are illustrated with numerous examples.
Details
- Publisher
- Springer New York
- Authors
- Vivek S. Borkar, Vladimir Ejov, Jerzy A. Filar, Giang T. Nguyen
- Format
- Paperback
- Published
- May 8, 2014
- ISBN-13
- 9781489992277
- Pages
- 202
- Printing
- Printed on demand
Hamiltonian Cycle Problem and Markov Chains (International Series in Operations Research & Management Science #171) for groups: pricing
Volume pricing applies automatically in your cart. No codes, no account needed.
| Copies | Price per copy | You save |
|---|---|---|
| 25 – 49 | $96.79 | 12% off list |
| 50 – 99 | $95.69 | 13% off list |
| 100+ | $94.59 | 14% off list |
Popular for
For new managers and leadership cohorts, a chapter per session.
A shared vocabulary for the whole organization.
A takeaway attendees will actually read, delivered to your venue.
Where can I buy 100 copies of Hamiltonian Cycle Problem and Markov Chains?
BookPal sells Hamiltonian Cycle Problem and Markov Chains in quantity. At 100 copies the price is $94.59 a copy, against a list price of $109.99, and the cart applies the volume tier automatically. Free shipping on most orders over $95 in the contiguous US. A specialist can quote a larger or mixed order.
- New books only, straight from the publisher
- Volume prices apply automatically in the cart, with no code needed
- Order at least 10 business days before you need the books (11 from mid-November through December)
What does Hamiltonian Cycle Problem and Markov Chains (International Series in Operations Research & Management Science #171) cost when I buy for a group?
Volume pricing applies automatically in your cart, with no code needed. Price per copy: 25 to 49 copies, $96.79 (12% off list); 50 to 99 copies, $95.69 (13% off list); 100+ copies, $94.59 (14% off list). Need a different quantity, or a quote to forward for approval? Ask a specialist and we will confirm pricing before you pay.
How fast can I get copies of Hamiltonian Cycle Problem and Markov Chains (International Series in Operations Research & Management Science #171)?
This title is printed on demand, so it needs production time before it ships. Need them by a specific date? Request a quote and we'll confirm timing before you pay.
Can you ship to several locations or people's homes?
Yes. We ship group orders to one address, to multiple sites, or to individual recipients, in the US and internationally. See fulfillment options.
Can I get a formal quote for approval before ordering?
Yes. Request a quote and we'll send a PDF you can forward for approval.
Do you accept purchase orders and tax-exempt orders?
Yes. We accept purchase orders upon approval, as well as cards, PayPal, ACH, wire transfers and checks. BookPal is a tax-exempt supplier in all 50 states. See purchase orders and sales tax exemption.
What if I find a lower price?
Send us the link. We match prices from other booksellers and distributors on a new copy in the same edition, available to ship in the quantity you need. Clearance sales and pricing errors are the exception, and we'll tell you quickly if that's the case. Start a price match.
Write a Review
Hamiltonian Cycle Problem and Markov Chains (International Series in Operations Research & Management Science #171)
Teams also order




A colleague asked you to approve this order
Your quote list
Add books as you browse, then request one quote for all of them.