| Bibliografia:
| BOAVENTURA NETTO, P. O. (1996) Grafos: Teoria, Modelos, Algoritmos ,
Editora Edgar Blucher Ltda, São Paulo.
BAZARAA M.S., JARVIS J.J., SHERALI H. D., 1990, Linear Programming and
Network Flows, 2nd. Ed., John Wiley & Sons.
EDMONDS,J. E KARP, R.M., 1972, “Theoretical Improvements in Algorithmic
Efficiency for Network Flow Problems”, J.ACM 19 ,pp248-264.
KENNINGTON J. L., HELGASON R.V., 1988, Algorithms for Network
Programming, John Wiley & Sons.
MINIEKA E.(1990)Optimization Algorithms for Networks and Graphs, Ed. Marcel
Dekker Inc. 1st and 2nd ed.
NEWELL G.F., 1980, Traffic Flow On Transportation Network, MIT Press.
POTTS R.B. , OLIVER R.M., 1972, Flows in Transportation Networks, Academic
Press , New York.
SHEFFI Y., 1985, Urban Transportation Network : Equilibrium Analysis with
Mathematical Programming Models, Prentice Hall Inc., Englewood Cliffs, N.J.
SHIER D. R., 1976, “Interactive Methods for Determining the K- Shortest Paths in a
Network”, Networks, No 6,pp 205-229.
STEENBRINK P.A., 1974, Optimization of Transport Networks, Ed. John Wiley &
Sons.
SYSLO M.M., NARSINGH D., KOWALIK J.S. 1983, Discrete Optimization
Algorithms With Pascal Programs, Prentice Hall, Inc. Englewood Cliffs..
TAAFFE E. J., GAUTHIER H.L., 1973, Geography of Transportation, Foundation of
Economic Geography Series, Prentice Hall, Inc., Englewood Cliffs, N.J.
YEN J.Y., 1971, “Finding the K- shortest Loopless Paths in a network”, Management
Science, vol.17, No 11, Jul. |
