On the Asymptotic Properties of Euclidean Dial-A-Ride Routing

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5367

Full metadata record

DC Field	Value	Language
dc.creator	Haimovich, Mordecai	-
dc.date	2004-05-28T19:36:00Z	-
dc.date	2004-05-28T19:36:00Z	-
dc.date	1985-10	-
dc.date.accessioned	2013-10-09T02:39:20Z	-
dc.date.available	2013-10-09T02:39:20Z	-
dc.date.issued	2013-10-09	-
dc.identifier	http://hdl.handle.net/1721.1/5367	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	A conjecture by Stein [1], proposing a probabilistic limit result for the shortest possible route of a bus that has to transfer passengers between random locations in some region of the plane, is refuted.- The existence of such limit result remains an open question.	-
dc.format	503454 bytes	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.publisher	Massachusetts Institute of Technology, Operations Research Center	-
dc.relation	Operations Research Center Working Paper;OR 145-85	-
dc.title	On the Asymptotic Properties of Euclidean Dial-A-Ride Routing	-
dc.type	Working Paper	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI