Show simple item record

dc.contributor.authorGolden, Bruce L., 1950-en_US
dc.date.accessioned2004-05-28T19:30:40Z
dc.date.available2004-05-28T19:30:40Z
dc.date.issued1975-10en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/5263
dc.description.abstractIn this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks.en_US
dc.format.extent1746 bytes
dc.format.extent590953 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.publisherMassachusetts Institute of Technology, Operations Research Centeren_US
dc.relation.ispartofseriesOperations Research Center Working Paper;OR 044-75en_US
dc.titleShortest Path Algorithms: A Comparisonen_US
dc.typeWorking Paperen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record