Brand New International Edition textbook. Some book may show sales disclaimer such as "Not for Sale or Restricted in US" on the cover page but it is absolutely legal to use in US or Canada. Ship from Multiple Locations, including Asia , Hong Kong ,Taiwan , US or Canada depend on stock location.

N� de ref. del art�culo 001808

Contactar al vendedor

Denunciar este art�culo

Detalles bibliogr�ficos

T�tulo: Network Flows: Theory, Algorithms, and Applications (1st International Edition)
Editor: Pearson
Fecha de publicaci�n: 1993
Idioma: Ingl�s
ISBN 10: 013617549X
ISBN 13: 9780136175490
Encuadernaci�n: Soft cover
Edici�n: 1st Edition
Estado: New

Acerca de

Sinopsis

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.

Rese�a del editor

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.

"Sobre este t�tulo" puede pertenecer a otra edici�n de este libro.