Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)

Papadimitriou, Christos H.; Steiglitz, Kenneth

ISBN 10: 0486402584 / ISBN 13: 9780486402581

Edité par Dover Publications, 1998

A propos de cet article

A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if youâ re not satisfied with purchase please return item for full refund. Ships via media mail. N° de réf. du vendeur OTV.0486402584.G

Détails bibliographiques

Titre : Combinatorial Optimization: Algorithms and ...

Éditeur : Dover Publications

Date d'édition : 1998

Reliure : Couverture souple

Etat : good

A propos de ce titre

Synopsis :

This book brings together in one volume the important ideas of computational complexity developed by computer scientists with the foundations of mathematical programming developed by the operations research community.

Présentation de l'éditeur:

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. 1982 ed.