ACM Home Page
Please provide us with feedback. Feedback
Cooperative facility location games
Full text PdfPdf (928 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms table of contents
San Francisco, California, United States
Pages: 76 - 85  
Year of Publication: 2000
ISBN:0-89871-453-2
Authors
Michel X. Goemans  Department of Mathematics, Room 2-351, M.I.T., Cambridge, MA and C.O.R.E., Louvain-la-Neuve, Belgium
Martin Skutella  TU Berlin, Fachbereich Mathematik, MA 6-1, Straβe des 17, Juni 136, 10623 Berlin, Germany and C.O.R.E., Louvain-la-Neuve, Belgium
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 36,   Citation Count: 13
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. L. Balinski. Integer programming: Methods, uses, computation. Management Science, 12:253- 313, 1965.
2
 
3
P. Chardaire. On the core of facility location games. Manuscript.
 
4
 
5
G. Cornu6jols, G. L. Nemhauser, and L. A. Wolsey. The uncapacitated facility location problem, in P. Mirchandani and R. Francis, editors, Discrete Location Theory, pages 119 - 17 I. John Wiley and Sons, Inc., New York, 1990.
 
6
M. Gr0tschel, L. Lov~z, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, Berlin, 1988.
 
7
 
8
A. Kolen. Solving covering problems and the uncapacitated plant location problem on trees. European Journal of Operational Research, 12:266- 278, 1983.
 
9
J. Krarup and O. Bilde. Plant location, set covering and economic lot size: an O(mn)-algorithm for structured problems. In L. Collatz and W. Wetterling, editors, Numerische Methoden bei Optimierungsaufgaben - Band 3 (Optimierkng bei graphentheoretischen und ganzzahligen Problemen), volume 36 of International series of numerical mathematics, pages 155-180. Birkhaeuser Verlag, 1977.
 
10
P. B. Mirchandani and P. L. Francis, editors. Discrete Location Theory. John Wiley & Sons, 1990.
 
11
 
12
H. Moulin. Cooperative Microeconomics: A Game-Theoretic Introduction. Princeton University Press, 1995.
 
13
 
14
A. Oudjit. Median Locations on Deterministic and Probabilistic Multidimensional Net;vorks. PhD thesis, Rensselaer Polytechnic Institute, Troy, New York, 1981.
 
15
M. Padberg. Linear Optimization and Extensions. Springer, Berlin, 1995.
 
16
A. Tamir. On the core of cost allocation games defined on location problems. Transportation Science, 27:81 - 86, 1992.
 
17

CITED BY  13
 
 
 
 
 
 

Collaborative Colleagues:
Michel X. Goemans: colleagues
Martin Skutella: colleagues

Peer to Peer - Readers of this Article have also read: