Newsletter   Secure Checkout   View Cart (0 items)  
Search:    Welcome Guest! Save up to 30-40% on most items with our awesome everyday discounts!

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) [Hardcover]

Our Price $ 70.45  
Retail Value $ 74.95  
You Save $ 4.50  
Item Number 232393  
Buy New $70.45
Quantity:
Available on the Internet only.

Item description for Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) by Bernhard Korte...

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





Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!

Item Specifications...


Pages   597
Est. Packaging Dimensions:   Length: 9.45" Width: 6.14" Height: 1.5"
Weight:   2.29 lbs.
Binding  Hardcover
Release Date   Oct 6, 2005
Publisher   Springer
ISBN  3540256849  
ISBN13  9783540256847  


Availability  102 units.
Availability accurate as of May 25, 2017 10:22.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.


More About Bernhard Korte


Register your artisan biography and upload your photo! Are You The Artisan or Author behind this product?
Improve our customers experience by registering for an Artisan Biography Center Homepage.



Product Categories

1Books > Special Features > New & Used Textbooks > Sciences > Mathematics
2Books > Subjects > Computers & Internet > General
3Books > Subjects > Computers & Internet > Programming > Algorithms > General
4Books > Subjects > Professional & Technical > Professional Science > Mathematics > Applied > Linear Programming
5Books > Subjects > Professional & Technical > Professional Science > Mathematics > Applied > Statistics
6Books > Subjects > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Combinatorics
7Books > Subjects > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Discrete Mathematics
8Books > Subjects > Professional & Technical > Professional Science > Mathematics > Pure Mathematics > Number Theory
9Books > Subjects > Science > General
10Books > Subjects > Science > Mathematics > Applied > Linear Programming
11Books > Subjects > Science > Mathematics > Applied > Probability & Statistics
12Books > Subjects > Science > Mathematics > General
13Books > Subjects > Science > Mathematics > Pure Mathematics > Combinatorics
14Books > Subjects > Science > Mathematics > Pure Mathematics > Discrete Mathematics
15Books > Subjects > Science > Mathematics > Pure Mathematics > Number Theory



Reviews - What do customers think about Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)?

Useful yet dense!  Nov 13, 2001
This is the most comprehensive compilation on combinatorial optiomization I have seen so far.
Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books:
(*) Combinatorial Optimization Algorithms and Complexity by Papadimitriou and Steiglitz.
(*) Integer and Combinatorial Optimization by Nemhauser and Wolsey
(*) Theory of linear and integer programming by Schrijver
(*) Combinatorial Optimization by Cook, Cunningham, Pulleyblank and Schrijver
(*)Combinatorial Algorithms by Kreher and Stinson

This book, on the other hand, contains so much information and so many proved theorems - it's the richest resuorce in this topic, in my humble opinion.

Using it as a graduate level textbook for an *introduction* to combinatorial optimization is kind of hard - as although it's richness, some topics are described without enough detail or examples (like the topics on network flow and bipartite graphs) - yet the authors probably assumed some previous knowledge in those topics.

I prefer using this book as a reference rather than and intoduction.

The heavy mathematical notations in this book might scare some readers, but no-fear! You quickly get used to it, and appreciate the greatness in the notations, as they make the theorems more short and to the point. On the other hand - getting back to this book for a quick review on some subject might force you to flip pages for a fwe minutes, just to remember the notation again.

The authors intended this book to be a graduaet level textbook or an up-to-date reference work for current research. I believe they accomplished both targets!

 

Write your own review about Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)



Ask A Question or Provide Feedback regarding Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)


Item Feedback and Product Questions
For immediate assistance call 888.395.0572 during the hours of 10am thru 8pm EST Monday thru Friday and a customer care representative will be happy to help you!

Help us continuously improve our service by reporting your feedback or questions below:

I have a question regarding this product
The information above is incorrect or conflicting
The page has misspellings or incorrect grammar
The page did not load correctly in my browser or created an error.

Email Address:
Anti Spam Question. To combat spammers we require that you answer a simple question.
What color is the sky?
Leave This Blank :
Do Not Change This Text :



Add This Product Widget To Your Website

Looking to add this information to your own website? Then use our Product Widget to allow you to display product information in a frame that is 120 pixels wide by 240 pixels high.

    Copy and paste the following HTML into your website and enjoy!



Order toll-free weekdays 10am thru 10pm EST by phone: 1-888-395-0572 (Lines are closed on holidays & weekends.)
Customer Service | My Account | Track My Orders | Return Policy | Request Free Catalog | Email Newsletter


Resources
Gift Certificates
RSS Feeds
Corporate
About Us
Contact Us
Policies
Terms Of Use
Privacy Policy