{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T19:44:14Z","timestamp":1775072654107,"version":"3.50.1"},"reference-count":38,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2004,2]]},"DOI":"10.1016\/s0196-6774(03)00098-1","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T11:40:25Z","timestamp":1062589225000},"page":"194-214","source":"Crossref","is-referenced-by-count":123,"title":["Cooperative facility location games"],"prefix":"10.1016","volume":"50","author":[{"given":"Michel X.","family":"Goemans","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(03)00098-1_BIB001","first-page":"3","article-title":"On the complexity of minimization problems for polynomials in boolean variables","volume":"23","author":"Ageev","year":"1983","journal-title":"Up-ravlyaemye Sistemy"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB002","series-title":"Integer Programming and Combinatorial Optimization","first-page":"237","article-title":"A criterion of polynomial-time solvability for the network location problem","author":"Ageev","year":"1992"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB003","series-title":"Network Flows. Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB004","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","article-title":"Integer programming: Methods, uses, computation","volume":"12","author":"Balinski","year":"1965","journal-title":"Manag. Sci."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB005","series-title":"Proceedings of the 31st Annual ACM Symposium on Theory of Computing","first-page":"622","article-title":"Approximating the throughput of multiple machines under real-time scheduling","author":"Bar-Noy","year":"1999"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB006","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02579383","article-title":"Packing and covering a tree by subtrees","volume":"6","author":"B\u00e1r\u00e1ny","year":"1986","journal-title":"Combinatorica"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB007","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/S0167-6377(99)00010-3","article-title":"On dependent randomized rounding algorithms","volume":"24","author":"Bertsimas","year":"1999","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB008","unstructured":"P. Chardaire, Facility location optimization and cooperative games, PhD thesis, University of East Anglia, Norwich, UK, 1998"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB009","series-title":"Integer Programming and Combinatorial Optimization","first-page":"180","article-title":"Improved approximation algorithms for uncapacitated facility location","volume":"vol. 1412","author":"Chudak","year":"1998"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB010","series-title":"Discrete Location Theory","first-page":"119","article-title":"The uncapacitated facility location problem","author":"Cornu\u00e9jols","year":"1990"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB011","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.24.3.751","article-title":"Algorithmic aspects of the core of combinatorial optimization games","volume":"24","author":"Deng","year":"1999","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB012","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s101070050005","article-title":"Totally balanced combinatorial optimization games","volume":"87","author":"Deng","year":"2000","journal-title":"Math. Program."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB013","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.19.2.257","article-title":"On the complexity of cooperative solution concepts","volume":"19","author":"Deng","year":"1994","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB014","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01263277","article-title":"On the complexity of testing membership in the core of min-cost spanning tree games","volume":"26","author":"Faigle","year":"1997","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB015","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s101070050008","article-title":"On the core of ordered submodular cost games","volume":"87","author":"Faigle","year":"2000","journal-title":"Math. Program."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB016","first-page":"12","article-title":"An effective algorithm for the solution of the location problem with service domains connected with respect to an acyclic network","volume":"23","author":"Gimadi","year":"1983","journal-title":"Upravlyaemye Sistemy"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB017","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02592333","article-title":"On the nucleolus of the basic vehicle routing game","volume":"72","author":"G\u00f6the-Lundgren","year":"1996","journal-title":"Math. Program."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB018","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0166-218X(92)00122-3","article-title":"On some optimization problems on k-trees and partial k-trees","volume":"48","author":"Granot","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB019","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1090\/trans2\/158\/05","article-title":"On polynomial solvability conditions for the simplest plant location problem","volume":"158","author":"Grishukhin","year":"1994","journal-title":"Trans. Amer. Math. Soc. Ser. 2"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB020","article-title":"Geometric Algorithms and Combinatorial Optimization","volume":"vol. 2","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB021","series-title":"Proceedings of the 9th Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"649","article-title":"Greedy strikes back: Improved facility location algorithms","author":"Guha","year":"1998"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB022","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/0377-2217(83)90197-2","article-title":"Solving covering problems and the uncapacitated plant location problem on trees","volume":"12","author":"Kolen","year":"1983","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB023","series-title":"Discrete Location Theory","first-page":"263","article-title":"Covering problems","author":"Kolen","year":"1990"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB024","series-title":"Numerische Methoden bei Optimierungsaufgaben, Band 3 (Optimierung bei graphentheoretischen und ganzzahligen Problemen)","first-page":"155","article-title":"Plant location, set covering and economic lot size: an O(mn)-algorithm for structured problems","volume":"vol. 36","author":"Krarup","year":"1977"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB025","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","article-title":"Approximation algorithms for scheduling unrelated parallel machines","volume":"46","author":"Lenstra","year":"1990","journal-title":"Math. Program."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB026","series-title":"Discrete Location Theory","year":"1990"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB027","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB028","series-title":"Cooperative Microeconomics: A Game-Theoretic Introduction","author":"Moulin","year":"1995"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB029","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB030","unstructured":"A. Oudjit, Median locations on deterministic and probabilistic multidimensional networks, PhD thesis, Rensselaer Polytechnic Institute, Troy, NY, 1981"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB031","series-title":"Game Theory","author":"Owen","year":"1995"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB032","series-title":"Linear Optimization and Extensions","author":"Padberg","year":"1995"},{"key":"10.1016\/S0196-6774(03)00098-1_BIB033","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1287\/moor.9.2.309","article-title":"On the core and dual set of linear programming games","volume":"9","author":"Samet","year":"1984","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB034","doi-asserted-by":"crossref","first-page":"245","DOI":"10.2307\/2526837","article-title":"Cores of games with fixed costs and shared facilities","volume":"31","author":"Sharkey","year":"1990","journal-title":"Internat. Econom. Rev."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB035","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","article-title":"An approximation algorithm for the generalized assignment problem","volume":"62","author":"Shmoys","year":"1993","journal-title":"Math. Program."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB036","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1287\/trsc.27.1.81","article-title":"On the core of cost allocation games denned on location problems","volume":"27","author":"Tamir","year":"1992","journal-title":"Transp. Sci."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB037","first-page":"1604","article-title":"An effective algorithm for solving the distribution problem in a network in the form of a tree","volume":"17","author":"Trubin","year":"1976","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0196-6774(03)00098-1_BIB038","series-title":"Approximation Algorithms","author":"Vazirani","year":"2001"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000981?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677403000981?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T06:29:49Z","timestamp":1551076189000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677403000981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0196677403000981"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(03)00098-1","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}