{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T19:05:59Z","timestamp":1660331159081},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,6,3]],"date-time":"2006-06-03T00:00:00Z","timestamp":1149292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s10107-006-0002-7","type":"journal-article","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T15:13:10Z","timestamp":1149261190000},"page":"261-285","source":"Crossref","is-referenced-by-count":5,"title":["Polyhedral Properties of the K-median Problem on a Tree"],"prefix":"10.1007","volume":"110","author":[{"given":"Sven","family":"de Vries","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc E.","family":"Posner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rakesh V.","family":"Vohra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,3]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Arya, V., Garg, N., Khandekar, R., Pandit, V., Meyerson, A., Munagala, K.: Local search heuristics for K-median and facility location problems. In: 33rd annual ACM symposium on theory of computing, pp. 21\u201329 (2001)","DOI":"10.1145\/380752.380755"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/PL00011405","volume":"89","author":"P. Avella","year":"2001","unstructured":"Avella P., Sassano A. (2001). On the p-median polytope. Math Programming 89:395\u2013411","journal-title":"Math Programming"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02579383","volume":"6","author":"I. Barany","year":"1986","unstructured":"Barany I., Edmonds J., Wolsey L. (1986). Packing and covering a tree by subtrees. Combinatorica 6:221\u2013233","journal-title":"Combinatorica"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1287\/moor.8.4.579","volume":"8","author":"D.C. Cho","year":"1983","unstructured":"Cho D.C., Johnson E.L., Padberg M.W. (1983). On the uncapacitated plant location problem. I: valid inequalities and facets. Math Operations Res 8:579\u2013589","journal-title":"Math Operations Res"},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF01583779","volume":"23","author":"G. Cornuejols","year":"1982","unstructured":"Cornuejols G., Thizy J.M. (1982). Some facets of the simple plant location problem. Math Programming 23:50\u201374","journal-title":"Math Programming"},{"key":"2_CR6","unstructured":"Goemans, M.: Notes on the median polytope on trees, notes (1992)"},{"key":"2_CR7","first-page":"263","volume-title":"Discrete location theory","author":"A. Kolen","year":"1990","unstructured":"Kolen A., Tamir A. (1990). Covering Problems. In: Mirchandani P.B., Francis R.L. (eds) Discrete location theory. Wiley-Interscience, New York, pp. 263\u2013304"},{"key":"2_CR8","volume-title":"Some properties of the K-median problem polytope","author":"P. Lemke","year":"1986","unstructured":"Lemke P. (1986). Some properties of the K-median problem polytope. PhD Dissertation, Rensselaer polytechnic Institute, Troy"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1137\/0210023","volume":"10","author":"N. Megiddo","year":"1981","unstructured":"Megiddo N., Tamir A., Zemel E., Chandrasekaran R. (1981). An O(n log2 n) algorithm for the K-th longest path in a tree with applications to location problems. SIAM J Comput 10:328\u2013337","journal-title":"SIAM J Comput"},{"key":"2_CR10","first-page":"55","volume-title":"Discrete Location theory","author":"P.B. Mirchandani","year":"1990","unstructured":"Mirchandani P.B. (1990). The p-median problem and generalizations. In: Mirchandani P.B., Francis R.L. (eds) Discrete Location theory. Wiley-Interscience, New York, pp. 55\u2013110"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Tamir A. (1996). An O(p n 2) algorithm for the p-median and related problems on tree graphs. 19, 59\u201364","DOI":"10.1016\/0167-6377(96)00021-1"},{"key":"2_CR12","unstructured":"Ward, J., Wong, R.T., Lemke, P., Oudjit ,A.: Properties of the tree K-median Linear Programming Relaxation (manuscript) (1994)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0002-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0002-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0002-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:00Z","timestamp":1559123400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0002-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,3]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["2"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0002-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,3]]}}}