Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5156Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Berman, Oded | - |
| dc.creator | Odoni, Amedeo R. | - |
| dc.date | 2004-05-28T19:25:39Z | - |
| dc.date | 2004-05-28T19:25:39Z | - |
| dc.date | 1978-10 | - |
| dc.date.accessioned | 2013-10-09T02:38:02Z | - |
| dc.date.available | 2013-10-09T02:38:02Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/5156 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | The median problem has been generalized to the case in which facilities can be moved, at a cost, on the network in response to changes in the state of the network. Such changes are brought about by changes in travel times on the links of the network due to the occurrence of probabilistic events. For the case examined here, transitions among states of the network are assumed to be Markovian. The problem is examined for an objective which is a weighted function of demand travel times and of facility relocation costs. It is shown that when these latter costs are a concave function of travel time, an optimal set of facility locations exists solely on the nodes of the network. The location-relocation problem is formulated as an integer programming problem and its computational complexity is discussed. An example illustrates the basic concepts of this paper. | - |
| dc.format | 1746 bytes | - |
| dc.format | 1294112 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 083-78 | - |
| dc.title | Locating Mobile Servers on a Network with Markovian Processes | - |
| dc.type | Working 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.