「算法」 最大流

• Graph theory
• Shortest paths
• Matching problems
• Network flow problems
• Spanning trees
• Location problems
• (Time permitting) Probability theory of combinatorial problems

---

TOP

附录

A 示例

B 参考文献

1. Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. Network flows: theory, algorithms, and applications. Prentice Hall, 1993.

2. David Easley and Jon Kleinberg. Networks, crowds, and markets: Reasoning about a highly connected world. Cambridge University Press, 2010.

3. Adam Kasperski. Discrete optimization and network flows. Wrocław University of Technology, 2011.

4. Bernhard Korte and Jens Vygen. Combinatorial optimization: theory and algorithms. Springer, 2008. Available online via USC Libraries.

5. R. Tyrrell Rockafellar. Network flows and monotropic optimization. Wiley New York, 1984.