Cover title. "September 1990."Includes bibliographical references (p. 18-19).Research supported by the BM/C3 Technology branch of the United States Army Strategic Defense Command.by Dimitri P. Bertsekas and David A. Castañon
Caption title.Includes bibliographical references (p. 40-43).by Dimitri P. Bertsekas and David A. Ca...
Cover title.Includes bibliographical references (p. 25-27).Supported by ONR. N00014-94-1-0099 Suppor...
Includes bibliographical references (p. 8-9).Supported by NSF. DDM-8921835 Supported by the Air Forc...
"This report is a substantial revision of report LIDS-P-1998, September 1990."Includes bibliographic...
"October 1982."Bibliography: p. 32.National Science Foundation Contract NSF/ECS 79-20834by Dimitri P...
"An earlier, shorter version of this paper appears in the Proceedings of the 25th IEEE Conference on...
We introduce a broad class of algorithms for finding a minimum cost flow in a capacitated network. T...
Title from cover.Bibliography: p. 55-57.National Science Foundation Grant NSF-ECS-8217668.by Dimitri...
The dual function value q(p) at a vector p is obtained by Abstract minimizing L(f, p) over all f sat...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allo...
"Most of the results of this report were presented at the National ORSA/TIMS meeting, Chicago, May 1...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...
Bibliography: p. 58-60."October, 1983."Supported by the National Science Foundation under Grant NSF-...
Cover title.Includes bibliographical references (p. 28-32).by Dimitri P. Bertsekas and David A. Cast...
Cover title.Includes bibliographical references.Supported by [National Science Foundation] NSF-ECS-8...
Caption title.Includes bibliographical references (p. 40-43).by Dimitri P. Bertsekas and David A. Ca...
Cover title.Includes bibliographical references (p. 25-27).Supported by ONR. N00014-94-1-0099 Suppor...
Includes bibliographical references (p. 8-9).Supported by NSF. DDM-8921835 Supported by the Air Forc...
"This report is a substantial revision of report LIDS-P-1998, September 1990."Includes bibliographic...
"October 1982."Bibliography: p. 32.National Science Foundation Contract NSF/ECS 79-20834by Dimitri P...
"An earlier, shorter version of this paper appears in the Proceedings of the 25th IEEE Conference on...
We introduce a broad class of algorithms for finding a minimum cost flow in a capacitated network. T...
Title from cover.Bibliography: p. 55-57.National Science Foundation Grant NSF-ECS-8217668.by Dimitri...
The dual function value q(p) at a vector p is obtained by Abstract minimizing L(f, p) over all f sat...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allo...
"Most of the results of this report were presented at the National ORSA/TIMS meeting, Chicago, May 1...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...
Bibliography: p. 58-60."October, 1983."Supported by the National Science Foundation under Grant NSF-...
Cover title.Includes bibliographical references (p. 28-32).by Dimitri P. Bertsekas and David A. Cast...
Cover title.Includes bibliographical references.Supported by [National Science Foundation] NSF-ECS-8...
Caption title.Includes bibliographical references (p. 40-43).by Dimitri P. Bertsekas and David A. Ca...
Cover title.Includes bibliographical references (p. 25-27).Supported by ONR. N00014-94-1-0099 Suppor...
Includes bibliographical references (p. 8-9).Supported by NSF. DDM-8921835 Supported by the Air Forc...