{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:56:10Z","timestamp":1648857370391},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2009,8,8]],"date-time":"2009-08-08T00:00:00Z","timestamp":1249689600000},"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":[[2011,6]]},"DOI":"10.1007\/s10107-009-0301-x","type":"journal-article","created":{"date-parts":[[2009,8,7]],"date-time":"2009-08-07T12:37:56Z","timestamp":1249648676000},"page":"171-203","source":"Crossref","is-referenced-by-count":2,"title":["A large class of facets for the K-median polytope"],"prefix":"10.1007","volume":"128","author":[{"given":"Wenhui","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc E.","family":"Posner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,8,8]]},"reference":[{"key":"301_CR1","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/PL00011405","volume":"89","author":"P. Avella","year":"2001","unstructured":"Avella P., Sassano A.: On the p-median polytope. Math. Program. 89, 395\u2013411 (2001)","journal-title":"Math. Program."},{"key":"301_CR2","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/3-540-45586-8_2","volume-title":"Computational Combinatorial Optimization, LNCS 2241","author":"E. Balas","year":"2001","unstructured":"Balas E.: Projection and lifting in combinatorial optimization. In: J\u00fcnger, M., Naddef, D. (eds) Computational Combinatorial Optimization, LNCS 2241, pp. 26\u201356. Springer, Berlin (2001)"},{"key":"301_CR3","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"2005","unstructured":"Bazaraa M.S., Jarvis J.J., Sherali H.D.: Linear Programming and Network Flows. 3rd edn. Wiley, NJ (2005)","edition":"3"},{"key":"301_CR4","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0167-6377(01)00062-1","volume":"28","author":"I.R. Farias de","year":"2001","unstructured":"de Farias I.R.: A family of facets for the p-median polytope. Oper. Res. Lett. 28, 161\u2013167 (2001)","journal-title":"Oper. Res. Lett."},{"key":"301_CR5","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10107-006-0002-7","volume":"110","author":"S. Vries de","year":"2003","unstructured":"de Vries S., Posner M.E., Vohra R.V.: Polyhedral properties of the K-median problem on a tree. Math. Program. 110, 261\u2013285 (2003)","journal-title":"Math. Program."},{"key":"301_CR6","volume-title":"Notes on the Median Polytope on Trees, Notes","author":"M. Goemans","year":"1992","unstructured":"Goemans M.: Notes on the Median Polytope on Trees, Notes. Massachusetts Institute of Technology, Cambridge (1992)"},{"key":"301_CR7","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S. Hakimi","year":"1964","unstructured":"Hakimi S.: Optimum locations of switching centres and the absolute centres and medians on a graph. Oper. Res. 12, 450\u2013459 (1964)","journal-title":"Oper. Res."},{"key":"301_CR8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0167-6377(82)90005-0","volume":"1","author":"W.L. Hsu","year":"1982","unstructured":"Hsu W.L.: The distance-domination numbers of trees. Oper. Res. Lett. 1, 96\u2013100 (1982)","journal-title":"Oper. Res. Lett."},{"key":"301_CR9","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv O., Hakimi S.L.: An algorithmic approach to network location problems II: the p-medians. SIAM J. Appl. Math. 37, 539\u2013560 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"301_CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"Tamir A.: An O(pn 2) algorithm for the p-median and related Problems on tree graphs. Oper. Res. Lett. 19, 59\u201364 (1996)","journal-title":"Oper. Res. Lett."},{"key":"301_CR11","unstructured":"Zhao, W., Posner, M.E.: New Classes of Facets for the K-median Polytope, Working Paper, The Ohio State University, Columbus, OH (2007)"},{"key":"301_CR12","unstructured":"Zhao, W., Posner M.E.: Valid Inequalities for the K-median Problem on a Tree, Working Paper, The Ohio State University, Columbus, OH (2007)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0301-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-009-0301-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0301-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:06Z","timestamp":1559123406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-009-0301-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,8]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["301"],"URL":"https:\/\/doi.org\/10.1007\/s10107-009-0301-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,8]]}}}