| Title:
|
COMBINATORIAL OPTIMIZATION
THEORY AND ALGORITHMS |
| By: |
Bernhard Korte, Jens Vygen |
| Format: |
Paperback |
| List price:
|
£69.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
3642090923 |
| ISBN 13: |
9783642090929 |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
10 November, 2010 |
| Edition: |
Softcover reprint of hardcover 4th ed. 2008 |
| Series: |
Algorithms and Combinatorics 21 |
| Pages: |
627 |
| Description: |
Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. Recent topics are covered as well, and numerous references are provided. |
| Synopsis: |
Now fully updated in a third edition, this is a comprehensive textbook on combinatorial optimization. It puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete but concise proofs, also for many deep results, some of which have not appeared in print before. Recent topics are covered as well, and numerous references are provided. 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. |
| Illustrations: |
2 Tables, black and white; 77 Illustrations, black and white; XVIII, 627 p. |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Returnable |