๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

Network flows: theory, algorithms, and applications(conservative)

โœ Scribed by Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin

Publisher
Prentice Hall
Year
1993
Tongue
English
Leaves
862
Edition
United States ed
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis

Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including a description of new and novel polynomial-time algorithms for these core models. For professionals working with network flows, optimization, and network programming.

๐Ÿ“œ SIMILAR VOLUMES

Network flows: Theory, algorithms, and a
๐Ÿ“ Network flows: Theory, algorithms, and applications
โœ Ahuja R.K., Magnanti T.L., Orlin J.B. ๐Ÿ“‚ Library ๐Ÿ“… 1993 ๐Ÿ› PH ๐ŸŒ English

Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum

Network Flows. Theory, Algorithms, and A
๐Ÿ“ Network Flows. Theory, Algorithms, and Applications
โœ Ahuja R.K., Magnant T.L., Orlin J.B. ๐Ÿ“‚ Library ๐ŸŒ English

Prentice Hall, 1993. โ€” 863 p.<div class="bb-sep"></div>Network flows is an exciting field that brings together what many students, practitioners, and researchers like best about the mathematical and computational sciences. It couples deep intellectual content with a remarkable range of applicability