Combinatorial Optimization Algorithms And Complexity - Couverture souple
Livre 18 sur 19: Dover Books on Computer Science
Synopsis
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Autres éditions populaires du même titre
Résultats de recherche pour Combinatorial Optimization Algorithms And Complexity
Image fournie par le vendeur
Combinatorial Optimization Algorithms And Complexity
Edité par
Prentice Hall of India Private Ltd
ISBN 10 : 8120311396
ISBN 13 : 9788120311398
Ancien ou d'occasion
Couverture souple
Vendeur : Bay State Book Company, North Smithfield, RI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : good. The book is in good condition with all pages and cover intact, including the dust jacket if originally issued. The spine may show light wear. Pages may contain some notes or highlighting, and there might be a "From the library of" label. Boxed set packaging, shrink wrap, or included media like CDs may be missing. N° de réf. du vendeur BSM.TQ5D
Acheter D'occasion
EUR 40,35
Livraison gratuite
Expédition nationale : Etats-Unis
Expédition nationale : Etats-Unis
Quantité disponible : 1 disponible(s)