[AMO93]

Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., February 1993.

[Boost]

Boost C++ Libraries. http://www.boost.org/.

[BKV98]

Ursula Bünnagel, Bernhard Korte, and Jens Vygen. Efficient implementation of the Goldberg-Tarjan minimum-cost flow algorithm. Optimization Methods and Software, 10:157-174, 1998.

[CMake]

CMake – Cross Platform Make. http://www.cmake.org/.

[COIN-OR]

COIN-OR – Computational Infrastructure for Operations Research. http://www.coin-or.org/.

[CPLEX]

ILOG CPLEX. http://www.ilog.com/.

[Cbc]

Cbc – Coin-Or Branch and Cut. http://projects.coin-or.org/Cbc/.

[Clp]

Clp – Coin-Or Linear Programming. http://projects.coin-or.org/Clp/.

[CLRS01]

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. The MIT Press, 2nd edition, 2001.

[Dan63]

George B. Dantzig. Linear Programming and Extensions. Princeton University Press, 1963.

[DG98]

Ali Dasdan and Rajesh K. Gupta. Faster maximum and minimum mean cycle alogrithms for system performance analysis. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 17(10):889-899, 1998.

[Din70]

E. A. Dinic. Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Doklady, 11:1277-1280, 1970.

[Doxygen]

Doxygen – Source code documentation generator tool. http://www.doxygen.org/.

[EGRES]

EGRES – Egerváry Research Group on Combinatorial Optimization. http://www.cs.elte.hu/egres/.

[EK72]

Jack Edmonds and Richard M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM, 19(2):248-264, 1972.

[GLPK]

GLPK – GNU Linear Programming Kit. http://www.gnu.org/software/glpk/.

[Gol97]

Andrew V. Goldberg. An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms, 22(1):1-29, 1997.

[Gol08]

Andrew V. Goldberg. The partial augment-relabel algorithm for the maximum flow problem. 16th Annual European Symposium on Algorithms, pages 466-477, 2008.

[GT88]

Andrew V. Goldberg and Robert E. Tarjan. A new approach to the maximum flow problem. Journal of the ACM, 35(4):921-940, 1988.

[GT89]

Andrew V. Goldberg and Robert E. Tarjan. Finding minimum-cost circulations by canceling negative cycles. Journal of the ACM, 36(4):873-886, 1989.

[GT90]

Andrew V. Goldberg and Robert E. Tarjan. Finding minimum-cost circulations by successive approximation. Mathematics of Operations Research, 15(3):430-466, 1990.

[Kar78]

Richard M. Karp. A characterization of the minimum cycle mean in a digraph. Discrete Math., 23:309-311, 1978.

[KO91]

Damian J. Kelly and Garrett M. O'Neill. The minimum cost flow problem and the network simplex method. Master's thesis, University College, Dublin, Ireland, September 1991.

[Kle67]

Morton Klein. A primal method for minimal cost flows with applications to the assignment and transportation problems. Management Science, 14:205-220, 1967.

[LEDA]

LEDA – Library of Efficient Data Types and Algorithms. http://www.algorithmic-solutions.com/.

[LEMON]

LEMON – Library for Efficient Modeling and Optimization in Networks. http://lemon.cs.elte.hu/, 2009.

[MN99]

Kurt Mehlhorn and Stefan Näher. LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, New York, NY, USA, 1999.

[Sch03]

Alexander Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag, 2003.

[SLL02]

Jeremy G. Siek, Lee-Quan Lee, and Andrew Lumsdaine. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, 2002.

[ST83]

Daniel D. Sleator and Robert E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences, 26(3):362-391, 1983.

[SoPlex]

SoPlex – The Sequential Object-Oriented Simplex. http://soplex.zib.de/.

[Str00]

Bjarne Stroustrup. The C++ Programming Language. Addison-Wesley Professional, 3rd edition, February 2000.