Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference12 articles.
1. D.P. Bertsekas and E.M. Gafni, “Projection methods for variational inequalities with application to the traffic assignment problem,”Mathematical Programming Study 17 (1982) 139–159.
2. D.G. Cantor and M. Gerla, “Optimal routing in packet switched computer networks,”IEEE Transactions on Computing 23 (1974) 1062–1068.
3. R.J. Chen, “Parallel algorithms for a class of convex optimization problems,” Ph.D. Thesis, Computer Sciences Department, University of Wisconsin-Madison, 1987.
4. R.J. Chen and R.R. Meyer, “A scaled trust region method for a class of convex optimization problems,” University of Wisconsin-Madison Computer Sciences Department Tech. Rpt. #675.
5. G.B. Dantzig and P. Wolfe, “Decomposition principle for linear programs,”Operations Research 8 (1960) 101–111.
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献