{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:07:36Z","timestamp":1742951256688,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642200083"},{"type":"electronic","value":"9783642200090"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20009-0_51","type":"book-chapter","created":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T18:32:23Z","timestamp":1309026743000},"page":"319-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["P-Median Problems with an Additional Constraint on the Assignment Variables"],"prefix":"10.1007","author":[{"given":"Paula Camelia","family":"Trandafir","sequence":"first","affiliation":[]},{"given":"Jes\u00fas S\u00e1ez","family":"Aguado","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,21]]},"reference":[{"key":"51_CR1_51","doi-asserted-by":"crossref","unstructured":"M. S. Daski. Network and Discrete Location. Models, Algorithms and Applications. John Wiley and Sons, 1995.","DOI":"10.1002\/9781118032343"},{"key":"51_CR2_51","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1002\/net.3230100403","volume":"10","author":"G. Handler","year":"1980","unstructured":"G. Handler and I. Zang. A dual algorithm for the constrained path problem. Networks, 10: 293\u2013310, 1980.","journal-title":"Networks"},{"key":"51_CR3_51","doi-asserted-by":"crossref","unstructured":"A. J\u00fcttner, B. Szviatovszki, I. M\u00e9cs, and Z. Rajk\u00f3. Lagrange Relaxation Based Method for the QoS Routing Problem. In Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, pages 859\u2013868, 2001.","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"51_CR4_51","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1287\/mnsc.25.4.329","volume":"25","author":"J. M. Mulvey","year":"1979","unstructured":"J. M. Mulvey and H. P. Crowder. Cluster analysis: An application of lagrangian relaxation. Management Science, 25: 329\u2013340, 1979.","journal-title":"Management Science"},{"key":"51_CR5_51","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"M. G. C. Resende","year":"2004","unstructured":"M. G. C. Resende and R. F. Werneck. A hybrid heuristc for the p-median problem. Journal of Heuristics, 10: 59\u201388, 2004.","journal-title":"Journal of Heuristics"},{"key":"51_CR6_51","unstructured":"M. G. C. Resende and R.F. Werneck. On the implementation of a swap-based local search procedure for the p-median problem. In Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, pages 119\u2013127, 2003."},{"key":"51_CR7_51","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"M. B. Teitz","year":"1968","unstructured":"M. B. Teitz and P. Bart. Heuristic methods for estimating the generalized vertex median of a weigthed graph. Operations Research, 16: 955\u2013961, 1968.","journal-title":"Operations Research"},{"key":"51_CR8_51","first-page":"95","volume":"21","author":"R. Whitaker","year":"1983","unstructured":"R. Whitaker. A fast algorithm for the greedy interchange of large-scale clustering and median location problems. INFOR, 21: 95\u2013108, 1983.","journal-title":"INFOR"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2010"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20009-0_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T17:48:28Z","timestamp":1741283308000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-20009-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642200083","9783642200090"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20009-0_51","relation":{},"ISSN":["0721-5924"],"issn-type":[{"type":"print","value":"0721-5924"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"21 June 2011","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}