Add to ORKG"December 1985."Bibliography: p. 56-57.National Science Foundation Grant NSF-ECS-8217668by Dimitri P. Bertsekas, Patrick A. Hossein, Paul Tseng
Bibliography: p. 36-37.Supported in part by the National Science Foundation. NSF-ECS-8519058 Support...
We show that the algorithm of Bertsekas, Polymenakos, and Tseng for min-cost flows with convex separ...
Cover title.Includes bibliographical references (p. 28-32).by Dimitri P. Bertsekas and David A. Cast...
Bibliography: p. 58-60."October, 1983."Supported by the National Science Foundation under Grant NSF-...
Bibliography: p. 22-23."October 1984.""...supported by the National Science Foundation under Contrac...
Cover title. "The extended abstract of this article appeared in the proceedings of the 5th Internati...
Title from cover.Bibliography: p. 55-57.National Science Foundation Grant NSF-ECS-8217668.by Dimitri...
"An earlier, shorter version of this paper appears in the Proceedings of the 25th IEEE Conference on...
The dual function value q(p) at a vector p is obtained by Abstract minimizing L(f, p) over all f sat...
"October 1982."Bibliography: p. 32.National Science Foundation Contract NSF/ECS 79-20834by Dimitri P...
For the separable convex cost flow problem, we consider the problem of determining tolerance set for...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allo...
In this thesis we develop an efficient decomposition method for large-scale convex cost multi-commod...
Minimum cost flow (MCF) problem is a typical example of network flow problems, for which an addition...
For the separable convex cost flow problem, we consider the problem of determining tolerance set for...
Bibliography: p. 36-37.Supported in part by the National Science Foundation. NSF-ECS-8519058 Support...
We show that the algorithm of Bertsekas, Polymenakos, and Tseng for min-cost flows with convex separ...
Cover title.Includes bibliographical references (p. 28-32).by Dimitri P. Bertsekas and David A. Cast...
Bibliography: p. 58-60."October, 1983."Supported by the National Science Foundation under Grant NSF-...
Bibliography: p. 22-23."October 1984.""...supported by the National Science Foundation under Contrac...
Cover title. "The extended abstract of this article appeared in the proceedings of the 5th Internati...
Title from cover.Bibliography: p. 55-57.National Science Foundation Grant NSF-ECS-8217668.by Dimitri...
"An earlier, shorter version of this paper appears in the Proceedings of the 25th IEEE Conference on...
The dual function value q(p) at a vector p is obtained by Abstract minimizing L(f, p) over all f sat...
"October 1982."Bibliography: p. 32.National Science Foundation Contract NSF/ECS 79-20834by Dimitri P...
For the separable convex cost flow problem, we consider the problem of determining tolerance set for...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allo...
In this thesis we develop an efficient decomposition method for large-scale convex cost multi-commod...
Minimum cost flow (MCF) problem is a typical example of network flow problems, for which an addition...
For the separable convex cost flow problem, we consider the problem of determining tolerance set for...
Bibliography: p. 36-37.Supported in part by the National Science Foundation. NSF-ECS-8519058 Support...
We show that the algorithm of Bertsekas, Polymenakos, and Tseng for min-cost flows with convex separ...
Cover title.Includes bibliographical references (p. 28-32).by Dimitri P. Bertsekas and David A. Cast...