Author:
Chaillou Paul,Hansen Pierre,Mahieu Yvon
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. FORD L.R. and D.R. FULKERSON, Flows in networks, Princeton University Press, 1962.
2. GALLO G., M. GRIGORIADIS and R.E. TARJAN, “A Fast Parametric Network Flow Algorithm”, Research Report, Department of Computer Science, Rutgers University, N.J. (forthcoming).
3. GALLO G., P.L. HAMMER and B. SIMEONE, “Quadratic Knapsack Problem”, Math. Prog. Study 12 (1980), 132–149.
4. HAMMER P.L., “Some Network Flow Problem Solved with Pseudo-Boolean Programming”, Operations Research 13 (1965), 388–399.
5. KARZANOV A.V., “Determining the Maximum Flow in a Network by the Method of Preflows”, Soviet Math. Dokl. 15 (1974), 434–437.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献