Combinatorial Optimization
Combinatorial Optimization
Regular price
Checking stock...
Regular price
Checking stock...
Proud to be B-Corp
Our business meets the highest standards of verified social and environmental performance, public transparency and legal accountability to balance profit and purpose. In short, we care about people and the planet.
The feel-good place to buy books
- Free delivery in the UK
- Supporting authors with AuthorSHARE
- 100% recyclable packaging
- B Corp - kinder to people and planet
- Buy-back with World of Books - Sell Your Books
Combinatorial Optimization by Christos H Papadimitriou
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. Mathematicians wishing a self-contained introduction need look no further. American Mathematical Monthly.
Ken Steiglitz is a Eugene Higgins Professor of Computer Science Emeritus and Senior Scholar at Princeton University. He received his Doctor of Engineering Science degree from New York University in 1963. In 1997 he was inducted as a Fellow of the Association for Computer Music, and in 2000 he received the IEEE Third Millennium Medal. He is the author of several books, including The Charm of the Discrete Machine: Why the World Became Digital.
| SKU | Nicht verfügbar |
| ISBN 13 | 9780486402581 |
| ISBN 10 | 0486402584 |
| Titel | Combinatorial Optimization |
| Autor | Christos H Papadimitriou |
| Serie | Dover Books On Computer Science |
| Buchzustand | Nicht verfügbar |
| Bindungsart | Paperback |
| Verlag | Dover Publications Inc. |
| Erscheinungsjahr | 2000-02-01 |
| Seitenanzahl | 528 |
| Hinweis auf dem Einband | Die Abbildung des Buches dient nur Illustrationszwecken, die tatsächliche Bindung, das Cover und die Auflage können sich davon unterscheiden. |
| Hinweis | Nicht verfügbar |