SKU/Artículo: AMZ-013617549X

Network Flows: Theory, Algorithms, and Applications

Format:

Hardcover

Hardcover

Paperback

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

Sobre este producto
  • A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications. presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models.emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments.provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees.devotes a special chapter to conducting empirical testing of algorithms.features over 150 applications of network flows to a variety of engineering, management, and scientific domains.contains extensive reference notes and illustrations.
U$S 418,00
55% OFF
U$S 190,00

IMPORTÁ FACIL

Comprando este producto podrás descontar el IVA con tu número de RUT

NO CONSUME FRANQUICIA

Si tu carrito tiene solo libros o CD’s, no consume franquicia y podés comprar hasta U$S 1000 al año.

U$S 418,00
55% OFF
U$S 190,00

¡Comprá en hasta 12 cuotas sin interés con todas tus tarjetas!

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

Conoce más detalles

presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models. emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments. provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees. devotes a special chapter to conducting empirical testing of algorithms. features over 150 applications of network flows to a variety of engineering, management, and scientific domains. contains extensive reference notes and illustrations.