Buy New
$45.92
Qty:1
  • List Price: $54.99
  • Save: $9.07 (16%)
Only 2 left in stock (more on the way).
Ships from and sold by Amazon.com.
Gift-wrap available.
Iterative Methods in Comb... has been added to your Cart
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Iterative Methods in Combinatorial Optimization (Cambridge Texts in Applied Mathematics) Paperback – April 18, 2011

ISBN-13: 978-0521189439 ISBN-10: 0521189438 Edition: 1st

Buy New
Price: $45.92
23 New from $34.61 12 Used from $31.99
Amazon Price New from Used from
Kindle
"Please retry"
Paperback
"Please retry"
$45.92
$34.61 $31.99
Free Two-Day Shipping for College Students with Amazon Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Get Up to 80% Back When You Sell Us Your Books
$45.92 FREE Shipping. Only 2 left in stock (more on the way). Ships from and sold by Amazon.com. Gift-wrap available.
NO_CONTENT_IN_FEATURE
Best Books of the Month
Best Books of the Month
Want to know our Editors' picks for the best books of the month? Browse Best Books of the Month, featuring our favorite new books in more than a dozen categories.

Product Details


Editorial Reviews

Book Description

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.

About the Author

Lap-Chi Lau is an Assistant Professor in the Department of Computer Science and Engineering at The Chinese University of Hong Kong. Lap-Chi's main research interests are in combinatorial optimization and graph algorithms. His paper on Steiner tree packing was given the Machtey award in the IEEE Foundations of Computer Science Conference. His Ph.D. thesis was awarded the Doctoral Prize from the Canadian Mathematical Society and a Doctoral Prize from the Natural Sciences and Engineering Research Council of Canada.

R. Ravi is Carnegie Bosch Professor of Operations Research and Computer Science at Carnegie Mellon University. Ravi's main research interests are in combinatorial optimization (particularly in approximation algorithms), computational molecular biology and electronic commerce. He is currently on the editorial boards of Management Science and the ACM Transactions on Algorithms.

Mohit Singh is an Assistant Professor in the School of Computer Science, McGill University. He completed his Ph.D. in 2008 at the Tepper School of Business, Carnegie Mellon University, where his advisor was Professor R. Ravi. His thesis was awarded the Tucker prize by the Mathematical Programming Society. His research interests include approximation algorithms, combinatorial optimization and studying models that deal with uncertainty in data.

Customer Reviews

There are no customer reviews yet.
5 star
4 star
3 star
2 star
1 star
Share your thoughts with other customers

More About the Author

Discover books, learn about writers, read author blogs, and more.

Set up an Amazon Giveaway

Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more
Iterative Methods in Combinatorial Optimization (Cambridge Texts in Applied Mathematics)
This item: Iterative Methods in Combinatorial Optimization (Cambridge Texts in Applied Mathematics)
Price: $45.92
Ships from and sold by Amazon.com