Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5153
Full metadata record
DC FieldValueLanguage
dc.creatorBerman, Oded-
dc.creatorLarson, Richard C., 1943--
dc.date2004-05-28T19:25:31Z-
dc.date2004-05-28T19:25:31Z-
dc.date1978-07-
dc.date.accessioned2013-10-09T02:38:00Z-
dc.date.available2013-10-09T02:38:00Z-
dc.date.issued2013-10-09-
dc.identifierhttp://hdl.handle.net/1721.1/5153-
dc.identifier.urihttp://koha.mediu.edu.my:8181/xmlui/handle/1721-
dc.descriptionThe median problem has been generalized to include queueing-like congestion of facilities (which are assumed to have finite numbers of servers). In one statement of the problem, a closest available server is assumed to handle each service request. More general server assignment policies are allowed, however. The analysis requires keeping track of the states (available or unavailable) of all servers. Paralleling the standard deterministic median problem, the objective is to minimize the expected travel time associated with a random service request, weighted appropriately by the equilibrium state probabilities of the system. Under suitable conditions, it is shown that at least one set of optimal locations exists solely on the nodes of the network. This analysis ties together previously disparate efforts in network analysis and spatial queueing analysis.-
dc.descriptionPrepared under Grant Number 78NI-AX-0007 from the National Institute of Law Enforcement and Criminal Justice, Law Enforcement Assistance Administration, U.S. Department of Justice.-
dc.format1746 bytes-
dc.format1162016 bytes-
dc.formatapplication/pdf-
dc.languageen_US-
dc.publisherMassachusetts Institute of Technology, Operations Research Center-
dc.relationOperations Research Center Working Paper;OR 076-78-
dc.titleThe Congested Median Problem-
dc.typeWorking Paper-
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.