Author:
Wallace Stein W.,Wets Roger J. -B.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference12 articles.
1. E. Balas and W. Pulleyblank, “The perfectly matchable subgraph polytope of a bipartite graph,”Networks 13 (1983) 495–516.
2. Working Paper;J.W. Chinneck,1990
3. D. Gale, “A theorem of flows in networks,”Pacific Journal of Mathematics 7 (1957) 1073–1082.
4. H.J. Greenberg, “Diagnosing infeasibility in min-cost network flow problems. Part I: Primal infeasibility,”IMA Journal of Mathematics in Management 2 (1988) 39–51.
5. M. Grötschel,Polyedrische Charakterisierungen Kombinatorischer Optimierungsprobleme (Hain, Meisenhein am Glan, 1977).
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献