Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference8 articles.
1. S.P. Baum, “Integral near-optimal solutions to certain classes of linear programming problems”, Ph.D. Thesis, Cornell University School of OR/IE Technical Report No. 360, (Ithaca, New York, 1977).
2. J. Edmonds and R. Giles, “A min—max relation for submodular functions on graphs”,Annals of Discrete Mathematics 1 (1977) 185–204.
3. D.R. Fulkerson, “Blocking and anti-blocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168–194.
4. D.R. Fulkerson, “Anti-blocking polyhedra”,Journal of Combinatorial Theory Series (B) 12 (1972) 50–71.
5. D.R. Fulkerson, “On the Perfect Graph Theorem”, in: T.C. Hu and S.M. Robinson, eds.Mathematical Programming (Academic Press, New York, 1973) pp. 69–77.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献