logo
Product categories

EbookNice.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link.  https://ebooknice.com/page/post?id=faq


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookNice Team

(Ebook) Iterative Methods in Combinatorial Optimization by Lap-Chi Lau, R. Ravi, Mohit Singh ISBN 9780521189439, 9781107007512, 0521189438, 1107007518

  • SKU: EBN-2261824
Zoomable Image
$ 32 $ 40 (-20%)

Status:

Available

0.0

0 reviews
Instant download (eBook) Iterative Methods in Combinatorial Optimization after payment.
Authors:Lap-Chi Lau, R. Ravi, Mohit Singh
Pages:256 pages.
Year:2011
Editon:1
Publisher:Cambridge University Press
Language:english
File Size:1.38 MB
Format:pdf
ISBNS:9780521189439, 9781107007512, 0521189438, 1107007518
Categories: Ebooks

Product desciption

(Ebook) Iterative Methods in Combinatorial Optimization by Lap-Chi Lau, R. Ravi, Mohit Singh ISBN 9780521189439, 9781107007512, 0521189438, 1107007518

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence, and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms.
*Free conversion of into popular formats such as PDF, DOCX, DOC, AZW, EPUB, and MOBI after payment.

Related Products