Network Flow Problems
摘要
Network flow problemsNetwork flow problem are a certain kind of linear programming problems that arise in graph theoretic contexts. It turns out that the transportation and assignment problems, as formulated in Definitions 7.2 and 7.4 , respectively, admit a reformulation as network flow problems.