Combinatorial Optimization (Paperback)

Christos H. Papadimitriou

ISBN 10: 0486402584 / ISBN 13: 9780486402581

Editore: Dover Publications Inc., New York, 2000

Paperback. 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. This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9780486402581

Riassunto:

Un testo di livello universitario scritto in modo chiaro prende in considerazione l'algoritmo ellissoidale sovietico per la programmazione lineare; algoritmi efficienti per flusso di rete, matching, spanning tree e matroidi; la teoria dei problemi NP completi; algoritmi di approssimazione, euristiche di ricerca locale per problemi NP completi e altro ancora. I matematici che desiderano un'introduzione autosufficiente non hanno bisogno di cercare oltre. American Mathematical Monthly. Edizione del 1982.

Product Description: Book by Papadimitriou Christos H Steiglitz Kenneth

Dati bibliografici

Titolo: Combinatorial Optimization (Paperback)
Casa editrice: Dover Publications Inc., New York
Data di pubblicazione: 2000
Legatura: Paperback
Condizione: new