Author:
Tseng Paul,Bertsekas Dimitri P.
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference20 articles.
1. D.P. Bertsekas, P.A. Hosein and P. Tseng, “Relaxation methods for network flow problems with convex arc costs,”SIAM Journal on Control and Optimization 25 (1987) 1219–1243.
2. D.P. Bertsekas and S.K. Mitter, “A descent numerical method for optimization problems with nondifferentiable cost functionals,”SIAM Journal on Control 11 (1973) 637–652.
3. D.P. Bertsekas and P. Tseng, “Relaxation methods for minimum cost ordinary and generalized network flow problems,”Operations Research Journal 36 (1988) 93–114.
4. G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).
5. P. Hosein, “Relaxation algorithm for minimum cost network flow problems with convex, separable costs,” M.Sc. Thesis in Electrical Engineering and Computer Science, Massachusetts Institute of Technology (Cambridge, MA, 1985).
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献