Referências bibliográficas
[1] R.K. Ahuja, T.L. Magnanti, and J. Orlin, Network flows: Theory,
algorithms, and applications, Practice Hall, 1993.
[2] R.K. Ahuja and J.B. Orlin, A fast and simple algorithm for the maximum
flow problem, Operations Research (1989), no. 37, 748-759.
[3] R.K. Ahuja and J.B. Orlin, Distance-directed augmenting path algorithms for maximum-flow
and parametric maximum flow problems, Naval Research Logistics Quarterly
(1991), no. 38, 413-430.
[4] R. Bellman, On a routing problem, Quarterly of Applied Mathematics
(1958), no. 16, 87-90.
[5] W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, and A. Schrijver,
Combinatorial otimization, Wiley-Interscience series in discrete
mathematics and optimization, John Wiley & Son's, New York, 1998.
[6] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Introduction to
algorithms, 2nd. ed., The MIT Press and McGraw-Hill, 2001.
[7] E.W. Dijkstra, A note on two problems in connexion with graphs,
Numerische Mathematik 1 (1959), 269-271.
[8] E.A. Dinits, Algorithm for solution of a problem of maximum flow in a
network with power estimation, Sov. Math. Dokl. 11 (1970), no. 5,
1277-1280.
[9] J. Edmonds and R.M. Karp, Theoretical improvements in algorithmic
efficiency for network flow problems, J. ACM 19 (1972), no. 2,
248-264.
[10] P. Feofiloff, Notas de aula de MAC 5781 otimização combinatória,
http://www.ime.usp.br/~pf/, 2002.
[11] L.R. Ford and D.R. Fulkerson, Maximal flow through a network, CJM
8 (1956), 399-404.
[12] L.R. Ford and D.R. Fulkerson, Flows in networks, Princeton University Press, Princeton, NJ,
1962.
[13] A.V. Goldberg and R.E.Tarjan, A new approach to the maximum flow
problem, Journal of ACM (1988), no. 35, 921-940.
[14] A.V. Goldberg and R.E.Tarjan, Finding minimum-cost circulations by cancelling negative
cycles, Journal of ACM (1989), no. 36, 873-886.
[15] A.V. Goldberg and R.E.Tarjan, Solving minimum cost flow problem by successive approximation,
Mathematics of Operations Research (1990), no. 15, 430-466.
[16] J.C. Pina Jr., Notas de aula de MAC 328 algoritmos em grafos,
http://www.ime.usp.br/~coelho/grafos/, 1999.
[17] J.B. Orlin, A faster strongly polynomial minimum cost flow algorithm,
Operations Research (1988).
[18] A. Schrijver, Combinatorial optimization: Polyhedra and efficiency,
Algorithms and Combinatorics, vol. 24, Springer, 2003.
[19] Y. Shiloach and U. Vishkin, An O(n² log n) parallel max-flow
algorithm, Journal of Algorithms (1982), no. 3, 128-146.
[20] A.V. Goldberg, Network Optimization Library,
http://www.avglab.com/andrew/soft.html.
[21] D.E. Knuth and S. Levy, The CWEB system of structured documentation,
Addison-Wesley (1994).
[22] D.E. Knuth, Literate programming,
Center for the study of Language and Information (1992).
[23] D.E. Knuth, The Stanford GraphBase: A plataform for combinatorial computing,
ACM Press (1993).
[24] A.V. Karzanov, Determining the maximal flow in a network by the method of preflows,
Soviet Mathematics Doklady (1974), no. 15, 434-437.
[25] B. Schmidt, Test problems for max flow, min cost flow, mst, shortest path, and edge connectivity,
http://www.math.uni-augsburg.de/~schmidt/ bschmidt/OR_Testdata/.
|