1,721,966 research outputs found
New algorithms for assignment and transportation problems
No full textIncludes bibliographies.Research supported by National Science Foundation Grant ENG-79-06332 (87649)by Dimitri P. Bertsekas
Relaxation methods for problems with strictly convex separable costs and linear constraints
Full text linkBibliography: p. 25-26.National Science Foundation grant NSF-ECS-3217668by Paul Tseng, Dimitri P. Bertsekas
Relaxation methods for linear programs
Full text linkBibliography: p. 44-45.National Science Foundation grant NSF-ECS-3217668by Paul Tseng, Dimitri P. Bertsekas
Relaxation methods for minimum cost ordinary and generalized network flow problems
Full text linkTitle from cover.Bibliography: p. 55-57.National Science Foundation Grant NSF-ECS-8217668.by Dimitri P. Bertsekas and Paul Tseng
Distributed asynchronous optimal routing in data networks
Full text linkBibliography: leaf 5."August 1984."DARPA Contract No. ONR-N00014-75-C-1183John N. Tsitsiklis, Dimitri P. Bertsekas
An analysis of stochastic shortest path problems
Full text linkCaption title. "October 1988."Includes bibliographical references.Supported by the National Science Foundation under grant NSF-ECS-8519058 Supported by the Army Research Office under grant DAAL03-86-K-0171 The second author supported by a Presidential Young Investigator Award with matching funds from IBM, Inc. and Dupont, Inc.by Dimitri P. Bertsekas and John N. Tsitsiklis
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Full text linkCover title. "This paper consists mainly of dissertation research results of the first author."--Cover.Includes bibliographical references (p. 31-34).Research supported in part by the Army Research Office. DAAL03-86-K-0171 Research supported in part by the National Science Foundation. ECS-8519058by Jonathan Eckstein, Dimitri P. Bertsekas
Thevenin decomposition and large-scale optimization
Full text linkCaption title.Includes bibliographical references (p. 14).Supported by the NSF. CCR-9103804by Dimitri P. Bertsekas
An auction algorithm for the max-flow problem
Full text linkCaption title.Includes bibliographical references.Supported by the NSF. CCR-9103804by Dimitri P. Bertsekas
A unified framework for primal-dual methods in minimum cost network flow problems
Full text link"October 1982."Bibliography: p. 32.National Science Foundation Contract NSF/ECS 79-20834by Dimitri P. Bertsekas
- …
