References
There are many references that discuss network programming. We list a few of them that
can be used as a starting point for the reader:
- J.L. Kennington and R. V. Helgason. Algorithms for Network Programming. John
Wiley & Sons, New York, 1980.
- R. K. Ahuja, T. L. Magnanti and J. B. Orlin. Network Flows: Theory, Algorithms, and
Applications. Prentice Hall, New Jersey, 1993.
- L. R. Ford and D. R. Fulkerson. Flows in Networks. Princeton University Press,
Princeton, New Jersey, 1962.
- K. G. Murty. Network Programming. Prentice Hall, New Jersey, 1992.
- R. T. Rockafellar. Network Flows and Monotropic Optimization. John Wiley &
Sons, New York, 1984.
Up To:
Network Programming.

[ OTC Home Page | NEOS Guide | NEOS Server | Optimization Tree ]
Updated 28 March 1996