Network flows: theory, algorithms, and applications

Front Cover
Prentice Hall, 1993 - Business & Economics - 846 pages
6 Reviews
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.

From inside the book

What people are saying - Write a review

User ratings

5 stars
5
4 stars
0
3 stars
1
2 stars
0
1 star
0

User Review - Flag as inappropriate

Approachable, powerful text.

Review: Network Flows: Theory, Algorithms, and Applications

User Review  - Trish Gillett - Goodreads

This book was the basis of one of my comprehensive exams for a PhD program. There is much emphasis on implementation: lots of discussion of data structures, etc. In my case we didn't need to know ... Read full review

Related books

Contents

INTRODUCTION
1
PATHS TREES AND CYCLES
23
ALGORITHM DESIGN AND ANALYSIS
53
Copyright

25 other sections not shown

Common terms and phrases

References from web pages

INFORMS Online Bookstore
Title: Network Flows : Theory, Algorithms, and Applications Author: Ravindra K. Ahuja,Thomas L. Magnanti,James B. Orlin Publisher: Prentice Hall ...
www2.informs.org/ Bookstore/ network.html

JSTOR: Network Flows: Theory, Algorithms, and Applications.
Network Flows: Theory, Algorithms, and Applications RAVINDRA K. AHUJA, THOMAS L. MAGNANTI and JAMES B. ORLIN Prentice Hall, Englewood Cliffs, New Jersey, ...
links.jstor.org/ sici?sici=0160-5682(199411)45%3A11%3C1340%3ANFTAAA%3E2.0.CO%3B2-8

Pearson - Network Flows: Theory, Algorithms, and Applications
Network Flows: Theory, Algorithms, and Applications, Ravindra K. Ahuja, Indian Institute of Technology, India Thomas L. Magnanti, Massachusetts Institute of ...
www.pearsonhighered.com/ educator/ academic/ product/ 0,3110,013617549X,00.html

Ravindra K. Ahuja
Network Flows:Theory, Algorithms, and Applications Ravindra K. Ahuja, Thomas L. Magnanti, and James Orlin Prentice Hall, 1993, 846 pages ...
www.ise.ufl.edu/ ahuja/ books.asp

Network flows
Network flows: theory, algorithms, and applications. Purchase this Book · Purchase this Book. Source. Pages: 846. Year of Publication: 1993 ...
portal.acm.org/ citation.cfm?id=137406& dl=ACM& coll=GUIDE

Books: NETWORK FLOWS: lr Ford, dr Fulkerson, Flows in Networks ...
kg Murty, Network Programming, Prentice Hall, (1992). rk Ahuja, T. Magnanti, jb Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, ...
www.utd.edu/ ~chandra/ documents/ 6381/ books-2.pdf

4 Maximum flow problem (A. Bockmayr) 4.1 Network flows 4.2 Maximum ...
Discrete Mathematics WS 05, A. Bockmayr, 12. Dezember 2005. 1. 4 Maximum flow problem (A. Bockmayr). 4.1 Network flows. • Network ...
www.inf.fu-berlin.de/ inst/ ag-bio/ FILES/ ROOT/ Teaching/ Lectures/ WS0506/ / AspekteBioinf/ network-flow_script.pdf

Flow network - Wikipedia, the free encyclopedia
[edit] References. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin (1993). Network Flows: Theory, Algorithms and Applications. Prentice Hall. ...
en.wikipedia.org/ wiki/ Flow_network

OPIM 915
"Network Flows : Theory, Algorithms, and Applications", by rk Ahuja, tl Magnanti and jb Orlin Prentice Hall, Englewood Cliffs, New Jersey, ...
opim.wharton.upenn.edu/ ~guignard/ 915_2007/ 915_2007.html

SYLLABUS IE 8753 NETWORK FLOWS AND DYNAMIC PROGRAMMING INSTRUCTOR ...
“Network Flows, Theory, Algorithms and Applications,” by R. Ahuja, T. Magnanti, and. J. Orlin, Prentice Hall, 1993. 1 . The Solution Manual for this book is ...
www.distance.msstate.edu/ gradcourses/ pdf/ IE_8753_Syllabus.pdf

Bibliographic information