{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T15:32:44Z","timestamp":1791214364450,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642215261","type":"print"},{"value":"9783642215278","type":"electronic"}],"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_45","type":"book-chapter","created":{"date-parts":[[2011,9,8]],"date-time":"2011-09-08T07:01:16Z","timestamp":1315465276000},"page":"401-405","source":"Crossref","is-referenced-by-count":6,"title":["The Multi-Commodity One-to-One Pickup-and-Delivery Traveling Salesman Problem: A Matheuristic"],"prefix":"10.1007","author":[{"given":"I.","family":"Rodr\u00edguez-Mart\u00edn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan Jos\u00e9","family":"Salazar-Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1008779125567","volume":"17","author":"N. Ascheuer","year":"2000","unstructured":"Ascheuer, N., J\u00fcnger, M., Reinelt, G.: A branch & cut algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints. Computational Optimization and Applications\u00a017, 61\u201384 (2000)","journal-title":"Computational Optimization and Applications"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G. Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G.: Static Pickup and Delivery Problems: A Classification Scheme and Survey. TOP\u00a015, 1\u201331 (2007)","journal-title":"TOP"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Le Pape, C.: Exploring relaxation induced neighborhoods to improve MIP solutions. Mathematical Programming A\u00a0102, 71\u201390 (2005)","journal-title":"Mathematical Programming A"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local Branching. Mathematical Programming B\u00a098, 23\u201347 (2003)","journal-title":"Mathematical Programming B"},{"key":"45_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1287\/ijoc.12.3.237.12636","volume":"13","author":"L.M. Gambardella","year":"2000","unstructured":"Gambardella, L.M., Dorigo, M.: An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem. INFORMS Journal on Computing\u00a013, 237\u2013255 (2000)","journal-title":"INFORMS Journal on Computing"},{"key":"45_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/net.20122","volume":"48","author":"L. Gouveia","year":"2006","unstructured":"Gouveia, L., Pesneau, P.: On extended formulations for the Precedence Constrained Asymmetric Traveling Salesman Problem. Networks\u00a048, 77\u201389 (2006)","journal-title":"Networks"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.dam.2003.09.013","volume":"145","author":"H. Hern\u00e1ndez-P\u00e9rez","year":"2004","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: A branch-and-cut algorithm for a Traveling Salesman Problem with Pickup and Delivery. Discrete Applied Mathematics\u00a0145, 126\u2013139 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"45_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/trsc.1030.0086","volume":"38","author":"H. Hern\u00e1ndez-P\u00e9rez","year":"2004","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem. Transportation Science\u00a038, 245\u2013255 (2004)","journal-title":"Transportation Science"},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1016\/j.ejor.2008.05.009","volume":"196","author":"H. Hern\u00e1ndez-P\u00e9rez","year":"2009","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: The multi-commodity one-to-one Pickup-and-Delivery Traveling Salesman Problem. Europoean Journal of Operational Research\u00a0196, 987\u2013995 (2009)","journal-title":"Europoean Journal of Operational Research"},{"key":"45_CR10","series-title":"Hybridizing Metaheuristics and Mathematical Programming, Annals of Information Systems","volume-title":"Matheuristics","year":"2009","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. (eds.): Matheuristics. Hybridizing Metaheuristics and Mathematical Programming, Annals of Information Systems. Springer, Heidelberg (2009)"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0377-2217(94)90360-3","volume":"79","author":"G. Mosheiov","year":"1994","unstructured":"Mosheiov, G.: The traveling salesman problem with pickup and delivery. European Journal of Operational Research\u00a079, 299\u2013310 (1994)","journal-title":"European Journal of Operational Research"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"S.N. Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Part I: Transportation between customers and depot. Journal f\u00fcr Betriebswirtschaft\u00a058, 21\u201351 (2008)","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S.N. Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. Journal f\u00fcr Betriebswirtschaft\u00a058, 81\u2013117 (2008)","journal-title":"Journal f\u00fcr Betriebswirtschaft"}],"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_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T00:18:12Z","timestamp":1538698692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21527-8_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215261","9783642215278"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21527-8_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}