Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Otras ediciones populares con el mismo título
Resultados de la búsqueda para Combinatorial Optimization Algorithms And Complexity
Imagen del vendedor
Combinatorial Optimization Algorithms And Complexity
Publicado por
Prentice Hall of India Private Ltd
ISBN 10: 8120311396
ISBN 13: 9788120311398
Antiguo o usado
Tapa blanda
Librería: Bay State Book Company, North Smithfield, RI, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: 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 ref. del artículo: BSM.TQ5D
Comprar usado
EUR 40,35
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 1 disponibles