SKU/Artículo: AMZ-0486402584

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

Format:

Paperback

Hardcover

Paperback

eTextbook

Detalles del producto
Disponibilidad:
En stock
Peso con empaque:
0.44 kg
Devolución:
Condición
Nuevo
Producto de:
Amazon
Viaja desde
USA

Sobre este producto
  • 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.
S/ 183.18
44% OFF
S/ 101.77

IMPORT EASILY

By purchasing this product you can deduct VAT with your RUT number

S/ 183.18
44% OFF
S/ 101.77

Hasta 6 cuotas sin intereses con BCP, BBVA y Diners

Llega en 10 a 15 días hábiles
con envío
Tienes garantía de entrega