MTU Library Catalogue

Syndetics cover image
Image from Syndetics

Network flows : theory, algorithms, and applications / Ravindra K. Ahuja, Thomas L. Magnanti and James B. Orlin.

By: Ahuja, Ravindra K, 1956-.
Contributor(s): Magnanti, Thomas L | Orlin, James B, 1953-.
Material type: materialTypeLabelBookPublisher: Upper Saddle River : Prentice Hall, 1993Description: xv, 846 p. : ill. ; 25 cm.ISBN: 013617549X.Subject(s): Network analysis (Planning) | Mathematical optimizationDDC classification: 658.4032
Contents:
Introduction -- Paths, trees and cycles -- Algorithm design and analysis -- Shortest paths: Label-setting algorithms -- Shortest paths: Label-correcting algorithms -- Maximum flows: basic ideas -- Maximum flows: polynomial algorithms -- Maximum flows: additional topics -- Minimum cost flows: basic algorithms -- Minimum cost flows: Polynomial algorithms -- Minimum cost flows: Network simplex algorithms -- Assignments and matchings -- Minimum spanning trees -- Convex cost flows -- Generalized flows -- Lagrangian relaxation and network optimization -- Multicommodity flows -- Computational testing of algorithms -- Additional applications.
Holdings
Item type Current library Call number Copy number Status Barcode
General lending MTU Bishopstown Library Lending 658.4032 (Browse shelf(Opens below)) 1 Available 00075191
Total holds: 0

Enhanced descriptions from Syndetics:

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.

Includes bibliographical references (pages 821-839) and index.

Introduction -- Paths, trees and cycles -- Algorithm design and analysis -- Shortest paths: Label-setting algorithms -- Shortest paths: Label-correcting algorithms -- Maximum flows: basic ideas -- Maximum flows: polynomial algorithms -- Maximum flows: additional topics -- Minimum cost flows: basic algorithms -- Minimum cost flows: Polynomial algorithms -- Minimum cost flows: Network simplex algorithms -- Assignments and matchings -- Minimum spanning trees -- Convex cost flows -- Generalized flows -- Lagrangian relaxation and network optimization -- Multicommodity flows -- Computational testing of algorithms -- Additional applications.

Table of contents provided by Syndetics

  • 1 Introduction
  • 2 Paths, Trees and Cycles
  • 3 Algorithm Design and Analysis
  • 4 Shortest Paths: Label Setting Algorithms
  • 5 Shortest Paths: Label Correcting Algorithms
  • 6 Maximum Flows: Basic Ideas
  • 7 Maximum Flows: Polynomial Algorithms
  • 8 Maximum Flows: Additional Topics
  • 9 Minimum Cost Flows: Basic Algorithms
  • 10 Minimum Cost Flows: Polynomial Algorithms
  • 11 Minimum Cost Flows: Network Simplex Algorithms
  • 12 Assignments and Matchings
  • 13 Minimum Spanning Trees
  • 14 Convex Cost Flows
  • 15 Generalized Flows
  • 16 Lagrangian Relaxation and Network Optimization
  • 17 Multicommodity Flows
  • 18 Computational Testing of Algorithms
  • 19 Additional Applications
  • Appendix A Data Structures
  • Appendix B NP-Completeness
  • Appendix C Linear Programming
  • Index
Previous
Back to results
Next
Close