Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Altre edizioni note dello stesso titolo
Risultati della ricerca per Combinatorial Optimization Algorithms And Complexity
Immagini fornite dal venditore
Combinatorial Optimization Algorithms And Complexity
Editore:
Prentice Hall of India Private Ltd
ISBN 10: 8120311396
ISBN 13: 9788120311398
Antico o usato
Brossura
Da: Bay State Book Company, North Smithfield, RI, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo BSM.TQ5D
Compra usato
EUR 40,48
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili