D.R. Fulkerson’s contributions to polyhedral combinatorics
暂无分享,去创建一个
[1] D. R. Fulkerson. NETWORKS, FRAMES, BLOCKING SYSTEMS , 1967 .
[2] D. R. Fulkerson,et al. MINIMIZING THE NUMBER OF CARRIERS TO MEET A FIXED SCHEDULE , 1954 .
[3] D. R. Fulkerson,et al. Blocking Pairs of Polyhedra Arising from Network Flows , 1975 .
[4] D. R. Fulkerson. On the Perfect Graph Theorem , 1973 .
[5] D. R. Fulkerson,et al. Maximal Flow Through a Network , 1956 .
[6] D. R. Fulkerson,et al. Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..
[7] D. R. Fulkerson. Note on Dilworth’s decomposition theorem for partially ordered sets , 1956 .
[8] D. R. Fulkerson,et al. Flows in Networks. , 1964 .