Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3319
Full metadata record
DC FieldValueLanguage
dc.contributorPolychronopoulos, George H. (George Harry)-
dc.contributorTsitsiklis, John N.-
dc.contributorMassachusetts Institute of Technology. Laboratory for Information and Decision Systems.-
dc.date2003-04-29T15:38:47Z-
dc.date2003-04-29T15:38:47Z-
dc.date1993-
dc.date.accessioned2013-06-04T16:16:37Z-
dc.date.available2013-06-04T16:16:37Z-
dc.date.issued2013-06-05-
dc.identifierhttp://hdl.handle.net/1721.1/3319-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionGeorge H. Polychronopoulos, John N. Tsitsiklis.-
dc.descriptionCaption title.-
dc.descriptionIncludes bibliographical references (p. 22-23).-
dc.descriptionSupported by the C.S. Draper Laboratory. DL-H-441625 Supported by a grant from Siemens A.G.-
dc.format23 p.-
dc.format1882649 bytes-
dc.formatapplication/pdf-
dc.languageeng-
dc.publisherMassachusetts Institute of Technology, Laboratory for Information and Decision Systems]-
dc.relationLIDS-P ; 2183-
dc.subjectTK7855.M41 E3845 no.2183-
dc.titleStochastic shortest path problems with recourse-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.