{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:52:07Z","timestamp":1725605527418},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215261"},{"type":"electronic","value":"9783642215278"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21527-8_43","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T07:01:16Z","timestamp":1315465276000},"page":"385-394","source":"Crossref","is-referenced-by-count":3,"title":["New Models for and Numerical Tests of the Hamiltonian p-Median Problem"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Gollowitzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dilson Lucas","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Wojciechowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"43_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s101070100209","volume":"91","author":"P. Bauer","year":"2002","unstructured":"Bauer, P., Linderoth, J., Savelsbergh, M.: A branch and cut approach to the cardinality constrained circuit problem. Mathematical Programming\u00a091(2), 307\u2013348 (2002)","journal-title":"Mathematical Programming"},{"issue":"1","key":"43_CR2","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0377-2217(90)90092-P","volume":"47","author":"I. Branco","year":"1990","unstructured":"Branco, I., Coelho, J.: The Hamiltonian p-median problem. European Journal of Operational Research\u00a047(1), 86\u201395 (1990)","journal-title":"European Journal of Operational Research"},{"key":"43_CR3","unstructured":"Cerdeira, J.: The hamiltonian k-median problem for any given k is NP-complete. Tech. rep., Centro de Estatistica e Aplicacoes, nota no. 14\/86 (1986)"},{"issue":"1-3","key":"43_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(02)00831-2","volume":"270","author":"Y. Egawa","year":"2003","unstructured":"Egawa, Y., Hagita, M., Kawarabayashi, K.I., Wang, H.: Covering vertices of a graph by k disjoint cycles. Discrete Mathematics\u00a0270(1-3), 115\u2013125 (2003)","journal-title":"Discrete Mathematics"},{"key":"43_CR5","first-page":"86","volume-title":"Proceedings of Operations Research 1997","author":"H. Glaab","year":"1998","unstructured":"Glaab, H., L\u00f6fflad, S., Pott, A.: Rundreiseprobleme beim halb-automatischen Lederzuschnitt. In: Proceedings of Operations Research 1997, pp. 86\u2013101. Springer, Heidelberg (1998)"},{"issue":"R42","key":"43_CR6","first-page":"2","volume":"7","author":"H. Glaab","year":"2000","unstructured":"Glaab, H., Pott, A.: The Hamiltonian p-median problem. The Electronic Journal of Combinatorics\u00a07(R42), 2 (2000)","journal-title":"The Electronic Journal of Combinatorics"},{"issue":"1","key":"43_CR7","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0377-2217(83)90182-0","volume":"12","author":"G. Laporte","year":"1983","unstructured":"Laporte, G., Nobert, Y., Pelletier, P.: Hamiltonian location problems. European Journal of Operational Research\u00a012(1), 82\u201389 (1983)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"43_CR8","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G. Nagy","year":"2007","unstructured":"Nagy, G., Salhi, S.: Location-routing: Issues, models and methods. European Journal of Operational Research\u00a0177(2), 649\u2013672 (2007)","journal-title":"European Journal of Operational Research"},{"key":"43_CR9","volume-title":"Integer and combinatorial optimization","author":"G. Nemhauser","year":"1999","unstructured":"Nemhauser, G., Wolsey, L.: Integer and combinatorial optimization. Wiley, New York (1999)"},{"issue":"8","key":"43_CR10","first-page":"355","volume":"1","author":"M. Zohrehbandian","year":"2007","unstructured":"Zohrehbandian, M.: A New Formulation of the Hamiltonian p-Median Problem. Applied Mathematical Sciences\u00a01(8), 355\u2013361 (2007)","journal-title":"Applied Mathematical Sciences"}],"container-title":["Lecture Notes in Computer Science","Network Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21527-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,2]],"date-time":"2019-04-02T05:28:15Z","timestamp":1554182895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}