Add to ORKGCaption title.Includes bibliographical references (p. 13-15).Research supported by the National Science Foundation. DDM-8903385 CCR-9103804 Research supported by the Army Research Office. DAAL03-86-K-0171by Dimitri P. Bertsekas
ABSTRACTIn this paper, we present a new auction algorithm for the linear assignment problem, based o...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...
Includes bibliographical references (p. 20-21).Supported by the NSF. CCR-9108058 Supported by the BM...
"May 1992." "This is a greatly revised version of the earlier report LIDS-P-2064."Includes bibliogra...
Cover title.Includes bibliographical references (p. 15-17).Research supported by the Army Research O...
Cover title.Includes bibliographical references (p. 28-32).by Dimitri P. Bertsekas and David A. Cast...
Caption title.Includes bibliographical references (p. 40-43).by Dimitri P. Bertsekas and David A. Ca...
Cover title.Includes bibliographical references.Supported by the U.S. Army Strategic Command.by Dimi...
Thesis (Ph.D.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Autho...
We propose a massively parallelizable algorithm for the classical assignment problem. The algorithm ...
Bibliography: p. 15-19.Work supported by grant NSF-ECS-8217668by Dimitri P. Bertsekas
The auction algorithm is a parallel relaxation nictliod for solving the classical assignment problem...
Includes bibliographical references (p. 16-17).Supported by the NSF. CCR-9103804 Supported by the AR...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Caption title.Includes bibliographical references.Supported by the NSF. CCR-9103804by Dimitri P. Ber...
ABSTRACTIn this paper, we present a new auction algorithm for the linear assignment problem, based o...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...
Includes bibliographical references (p. 20-21).Supported by the NSF. CCR-9108058 Supported by the BM...
"May 1992." "This is a greatly revised version of the earlier report LIDS-P-2064."Includes bibliogra...
Cover title.Includes bibliographical references (p. 15-17).Research supported by the Army Research O...
Cover title.Includes bibliographical references (p. 28-32).by Dimitri P. Bertsekas and David A. Cast...
Caption title.Includes bibliographical references (p. 40-43).by Dimitri P. Bertsekas and David A. Ca...
Cover title.Includes bibliographical references.Supported by the U.S. Army Strategic Command.by Dimi...
Thesis (Ph.D.)--Boston University PLEASE NOTE: Boston University Libraries did not receive an Autho...
We propose a massively parallelizable algorithm for the classical assignment problem. The algorithm ...
Bibliography: p. 15-19.Work supported by grant NSF-ECS-8217668by Dimitri P. Bertsekas
The auction algorithm is a parallel relaxation nictliod for solving the classical assignment problem...
Includes bibliographical references (p. 16-17).Supported by the NSF. CCR-9103804 Supported by the AR...
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Compute...
Caption title.Includes bibliographical references.Supported by the NSF. CCR-9103804by Dimitri P. Ber...
ABSTRACTIn this paper, we present a new auction algorithm for the linear assignment problem, based o...
Caption title.Includes bibliographical references (p. 9-10).Supported by the NSF. CCR-9103804by Dimi...
Includes bibliographical references (p. 20-21).Supported by the NSF. CCR-9108058 Supported by the BM...