A polyhedron with alls—t cuts as vertices, and adjacency of cuts
暂无分享,去创建一个
[1] Peter Elias,et al. A note on the maximum flow through a network , 1956, IRE Trans. Inf. Theory.
[2] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Richard M. Karp,et al. On Linear Characterizations of Combinatorial Optimization Problems , 1982, SIAM J. Comput..
[5] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .
[6] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .