Author:
Bixby R. E.,Marcotte O. M. -C.,Trotter L. E.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference17 articles.
1. S. Baum and L.E. Trotter, Jr., “Integer rounding for polymatroid and branching optimization problems,”SIAM Journal on Algebraic and Discrete Methods 2 (1981) 416–425.
2. R.G. Bland and J. Edmonds, “Fast primal algorithms for totally unimodular linear programming,” presented at XIth International Symposium on Mathematical Programming, Bonn, West Germany (Ausust 1982).
3. W. Cook, J. Fonlupt and A. Schrijver, “An integer analogue of Carathéodory's Theorem,” to appear.
4. W. Cunningham, “Testing membership in matroid polyhedra,”Journal of Combinatorial Theory (B) 32 (1984) 161–187.
5. W.H. Cunningham, “Optimal attack and reinforcement of a network,”Journal of the ACM 32 (1985) 549–561.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献