Forward path search : a new dual coordinate ascent algorithm for shortest paths

Cover title.

Bibliographic Details
Other Authors: Bertsekas, Dimitri P.
Language:eng
Published: Laboratory for Information and Decision Systems, Massachusetts Institute of Technology] 2003
Subjects:
Online Access:http://hdl.handle.net/1721.1/3203
_version_ 1826210019808378880
author2 Bertsekas, Dimitri P.
author_facet Bertsekas, Dimitri P.
collection MIT
description Cover title.
first_indexed 2024-09-23T14:39:57Z
id mit-1721.1/3203
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T14:39:57Z
publishDate 2003
publisher Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]
record_format dspace
spelling mit-1721.1/32032019-04-12T08:12:17Z Forward path search : a new dual coordinate ascent algorithm for shortest paths Bertsekas, Dimitri P. Massachusetts Institute of Technology. Laboratory for Information and Decision Systems. TK7855.M41 E3845 no.1973 Cover title. Includes bibliographical references (p. 21-22). Supported by the NSF. DDM-8903385 Supported by the ARO. DAAL03-86-K-0171 by Dimitri P. Bertsekas. 2003-04-29T15:35:12Z 2003-04-29T15:35:12Z 1990 http://hdl.handle.net/1721.1/3203 eng LIDS-P ; 1973 22 p. 1349607 bytes application/pdf application/pdf Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]
spellingShingle TK7855.M41 E3845 no.1973
Forward path search : a new dual coordinate ascent algorithm for shortest paths
title Forward path search : a new dual coordinate ascent algorithm for shortest paths
title_full Forward path search : a new dual coordinate ascent algorithm for shortest paths
title_fullStr Forward path search : a new dual coordinate ascent algorithm for shortest paths
title_full_unstemmed Forward path search : a new dual coordinate ascent algorithm for shortest paths
title_short Forward path search : a new dual coordinate ascent algorithm for shortest paths
title_sort forward path search a new dual coordinate ascent algorithm for shortest paths
topic TK7855.M41 E3845 no.1973
url http://hdl.handle.net/1721.1/3203