Iterative methods in combinatorial optimization
Our rough guess is there are 60,500 words in this book.
At a pace averaging 250 words per minute, this book will take 4 hours and 2 minutes to read. With a half hour per day, this will take 8 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Ravi, R. (Ramamoorthi), 1969- - Contributor
- Singh, Mohit - Contributor
Publication
2011 - Cambridge University Press, Cambridge, England
Language
English
Word Count
60,500 words, Guess
Page Count
242 pages
Identifiers
- Internet Archiveiterativemethods00lcla
- ISBN-101107007518
- ISBN-100521189438
- ISBN-139781107007512
- ISBN-139780521189439
and 6 more
- Library of Congress Control Number2011003653
- OCLC Control Number694393831
- Better World Books9780521189439
- Better World Books9781107007512
- Better World BooksO9-BLE-866
- Open LibraryOL24885092M
Classifications
- DDC518/.26
- LCCQA297.8 .L38 2011
- LCCQA402.5
Description
"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"-- "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"--
Subjects
Series Statement
- Cambridge texts in applied mathematics
Other Editions
- Iterative methods in combinatorial optimization
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!