{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:45:20Z","timestamp":1725749120628},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642406423"},{"type":"electronic","value":"9783642406430"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40643-0_29","type":"book-chapter","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T04:50:01Z","timestamp":1379479801000},"page":"279-288","source":"Crossref","is-referenced-by-count":3,"title":["A New Heuristic for the Capacitated Vertex p-Center Problem"],"prefix":"10.1007","author":[{"given":"Dagoberto R.","family":"Quevedo-Orozco","sequence":"first","affiliation":[]},{"given":"Roger Z.","family":"R\u00edos-Mercado","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems, Part I: The p-centers. SIAM Journal on Applied Mathematics\u00a037, 513\u2013538 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1287\/ijoc.1030.0028","volume":"16","author":"S. Elloumi","year":"2004","unstructured":"Elloumi, S., Labb\u00e9, M., Pochet, Y.: A new formulation and resolution method for the p-center problem. INFORMS Journal on Computing\u00a016(1), 84\u201394 (2004)","journal-title":"INFORMS Journal on Computing"},{"issue":"5","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1016\/j.cor.2004.09.035","volume":"33","author":"F.A. \u00d6zsoy","year":"2006","unstructured":"\u00d6zsoy, F.A., P\u0131nar, M.\u00c7.: An exact algorithm for the capacitated vertex p-center problem. Computers & Operations Research\u00a033(5), 1420\u20131436 (2006)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ejor.2009.02.022","volume":"201","author":"M. Albareda-Sambola","year":"2010","unstructured":"Albareda-Sambola, M., D\u00edaz-Garc\u00eda, J.A., Fern\u00e1ndez, E.: Lagrangean duals and exact solution to the capacitated p-center problem. European Journal of Operational Research\u00a0201(1), 71\u201381 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1002\/net.20000","volume":"43","author":"M.P. Scaparra","year":"2004","unstructured":"Scaparra, M.P., Pallottino, S., Scutell\u00e0, M.G.: Large-scale local search heuristics for the capacitated vertex p-center problem. Networks\u00a043(4), 241\u2013255 (2004)","journal-title":"Networks"},{"issue":"2","key":"29_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization\u00a06(2), 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R. Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research\u00a0177(3), 2033\u20132049 (2007)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"29_CR8","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research\u00a0130(3), 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"key":"29_CR9","series-title":"International Series in Operations Research & Management Science","volume-title":"Handbook of Metaheuristics","year":"2010","unstructured":"Gendreau, M., Potvin, J.Y. (eds.): Handbook of Metaheuristics, 2nd edn. International Series in Operations Research & Management Science, vol.\u00a0146. Springer, New York (2010)","edition":"2"},{"issue":"6","key":"29_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"M.E. Dyer","year":"1985","unstructured":"Dyer, M.E., Frieze, A.: A simple heuristic for the p-center problem. Operations Research Letters\u00a03(6), 285\u2013288 (1985)","journal-title":"Operations Research Letters"},{"key":"29_CR11","unstructured":"Bresina, J.L.: Heuristic-biased stochastic sampling. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, AAAI 1996, Portland, USA, vol.\u00a01, pp. 271\u2013278. AAAI Press (1996)"},{"key":"29_CR12","unstructured":"Loosemore, S., Stallman, R.M., McGrath, R., Oram, A., Drepper, U.: The GNU C Library Reference Manual: For version 2.17. Free Software Foundation, Boston, USA (2012)"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40643-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T07:10:35Z","timestamp":1558077035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40643-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406423","9783642406430"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40643-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}