Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/5368Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Haimovich, Mordecai | - |
| dc.creator | Magnanti, Thomas L. | - |
| dc.date | 2004-05-28T19:36:03Z | - |
| dc.date | 2004-05-28T19:36:03Z | - |
| dc.date | 1985-01 | - |
| 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/5368 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | We consider a two-person zero-sum game in which the maximizer selects a point in a given bounded planar region, the minimizer selects K points in that region,.and the payoff is the distance from the maximizer's location to the minimizer's location closest to it. In a variant of this game, the maximizer has the privilege of restricting the game to any subset of the given region. We evaluate/approximate the values (and the saddle point strategies) of these games for K = 1 as well as for K + , thus obtaining tight upper bounds (and worst possible demand distributions) for K-median problems. | - |
| dc.format | 1162655 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 133-85 | - |
| dc.title | Location Games and Bounds for Median Problems | - |
| 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.