Combinatorial Optimization
Algorithms and Complexity
Seiten
2000
|
Reprint
Dover Publications Inc. (Verlag)
978-0-486-40258-1 (ISBN)
Dover Publications Inc. (Verlag)
978-0-486-40258-1 (ISBN)
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.
Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1982 edition.
Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1982 edition.
| Erscheint lt. Verlag | 1.2.2000 |
|---|---|
| Reihe/Serie | Dover Books on Computer Science |
| Verlagsort | New York |
| Sprache | englisch |
| Maße | 140 x 216 mm |
| Gewicht | 524 g |
| Einbandart | Paperback |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Angewandte Mathematik |
| Mathematik / Informatik ► Mathematik ► Finanz- / Wirtschaftsmathematik | |
| Mathematik / Informatik ► Mathematik ► Graphentheorie | |
| ISBN-10 | 0-486-40258-4 / 0486402584 |
| ISBN-13 | 978-0-486-40258-1 / 9780486402581 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2025)
Springer Vieweg (Verlag)
CHF 62,95
Buch | Softcover (2025)
Springer Fachmedien Wiesbaden (Verlag)
CHF 69,95
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
