Publisher
Springer Berlin Heidelberg
Reference43 articles.
1. R. S. Barr and J. S. Turner, “Microdata File Merging through Large-Scale Network Technology”, Mathematical Programming Study 15, 1–22,1981.
2. R. Barr, F. Glover and D. Klingman, “A New Alternating Basis Algorithm for Semi-Assignment Networks”, in Proceedings of the Bicentennial Conference on Mathematical Programming, NBS, Gaithersburg, Maryland, USA,1977.
3. R. Barr, F. Glover and D. Klingman, “Enhancements of spanning tree labelling procedures for network optimization”, INFOR, 17, 16–34, 1979.
4. P. Beck, L. Lasdon and M. Engquist, “A Reduced Gradient Algorithm for Nonlinear Network Problems”, ACM Trans. on Math. Software, 9, 57–70,1983.
5. D. P. Bertsekas and E. M. Gafni, “Projection methods for minimum cost network flow problems”, Mathematical Programming Study 17, 1–22, 1981.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A General Network Generator;Mathematical Models for Decision Support;1988