Ships from/sold by Buy.com
See All Buying Options
advertisement
Earn Super Points: Write a Review
Sorry, this selection is currently unavailable.
Combinatorial Optimization: Theory and Algorithms Korte, Bernhard                         |Vygen, Jens                             |Korte, B. 1 of 1
$75.80  + Free Shipping
EARN 76 RAKUTEN SUPER POINTS™ Super Points
What are Rakuten Super Points™?
Get rewarded when you shop! Earn 1 point per dollar spent. That's like getting cash back on every purchase. Easy to see matured points in checkout. Use points just like cash.
Learn More
FORMAT: Hardcover
CONDITION:  Brand New
IN STOCK: Usually Ships within 24 hours
1 New
from
$75.80
See all sellers
45 day return policy
Share
 
Description
More Buying Options
 

Learn more about Combinatorial Optimization: Theory and Algorithms:

Format: Hardcover
ISBN-10: 3540256849
ISBN-13: 9783540256847
Sku: 202026878
Publish Date: 4/30/2007
Dimensions:  (in Inches) 9.25H x 6.5L x 1.5T
Pages:  613
Edition Number:  3
Age Range:  NA
See more in Discrete Mathematics
 
This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.

From the reviews of the 2nd edition:

"This book on combinatorial optimization is a beautiful example of the ideal textbook."

Operations Resarch Letters 33 (2005), p.216-217

"The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization."

OR News 19 (2003), p.42 

From the Publisher:
This comprehensive textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete but concise proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This third edition contains a new chapter on facility location problems, an area which has been extremely active in the past few years. Furthermore there are several new sections and further material on various topics. New exercises and updates in the bibliography were added.From the reviews of the 2nd edition:"This book on combinatorial optimization is a beautiful example of the ideal textbook."Operations Resarch Letters 33 (2005), p.216-217"The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization."OR News 19 (2003), p.42 
Advertisement Bottom