{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T06:27:32Z","timestamp":1791268052335,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540005803","type":"print"},{"value":"9783540364788","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36478-1_10","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T14:33:12Z","timestamp":1192890792000},"page":"89-104","source":"Crossref","is-referenced-by-count":25,"title":["The One-Commodity Pickup-and-Delivery Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Hip\u00f3lito","family":"Hern\u00e1ndez-P\u00e9rez","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","published-online":{"date-parts":[[2003,1,30]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"R.K. Ahuja, T.L. Magnanti, J.B. Orlin, \u201cNetwork Flows\u201d, in G.L. Nemhauser, A.H.G. Rinnooy Kan, M.J. Todd (Editors), \u201cOptimization\u201d I, North-Holland, 1989.","DOI":"10.21236\/ADA594171"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1002\/net.3230220408","volume":"22","author":"S. Anily","year":"1992","unstructured":"S. Anily, R. Hassin, \u201cThe Swapping Problem\u201d, Networks 22 (1992) 419\u2013433.","journal-title":"Networks"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0167-6377(94)90016-7","volume":"16","author":"S. Anily","year":"1994","unstructured":"S. Anily, G. Mosheiov, \u201cThe traveling salesman problem with delivery and backhauls\u201d, Operations Research Letters 16 (1994) 11\u201318.","journal-title":"Operations Research Letters"},{"key":"10_CR4","unstructured":"D. Applegate, R. Bixby, V. Chvatal, W. Cook, \u201cConcorde: a code for solving Traveling Salesman Problem\u201d, http:\/\/www.math.princeton.edu\/tsp\/concorde.html , 1999."},{"key":"10_CR5","series-title":"Research Report","volume-title":"Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem","author":"P. Augerat","year":"1995","unstructured":"P. Augerat, J.M. Belenguer, E. Benavent, A. Corber\u00e1n, D. Naddef, G. Rinaldi, \u201cComputational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem\u201d, Research Report 949-M, 1995, Universite Joseph Fourier, Grenoble, France."},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"E. Balas, M.W. Padberg, \u201cSet Partitioning: A survey\u201d, SIAM Review 18 (1976) 710\u2013760.","journal-title":"SIAM Review"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"J.F. Benders, \u201cPartitioning Procedures for Solving Mixed Variables Programming Problems\u201d, Numerische Mathematik 4 (1962) 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"10_CR8","unstructured":"M.R. Garey, D.S. Johnson, \u201cComputers and Intractability: A Guide to the Theory of NP-Completeness\u201d, W.H. Freeman and Co., 1979."},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/S0305-0548(98)00085-9","volume":"26","author":"M. Gendreau","year":"1999","unstructured":"M. Gendreau, G. Laporte, D. Vigo, \u201cHeuristics for the traveling salesman problem with pickup and delivery\u201d, Computers & Operations Research 26 (1999) 699\u2013714.","journal-title":"Computers & Operations Research"},{"key":"10_CR10","unstructured":"B.L. Golden, W.R. Stewart, \u201cEmpirical analysis of heuristics\u201d, in E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Editors), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley, 1985."},{"key":"10_CR11","unstructured":"H. Hern\u00e1ndez, J.J. Salazar, \u201cA Branch-and-Cut Algorithm for the Pickup-and-Delivery Travelling Salesman Problem\u201d, technical report, University of La Laguna, 2001. Available on http:\/\/webpages.ull.es\/users\/jjsalaza\/pdtsp.htm ."},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"M. J\u00fcnger, G. Reinelt, G. Rinaldi, \u201cThe Travelling Salesman Problem\u201d, in M.O. Ball, T.L. Magnanti, C.L. Monma, G.L. Nemhauser (Editors), Handbook in Operations Research and Management Science: Network Models, Elsevier, 1995.","DOI":"10.1016\/S0927-0507(05)80121-5"},{"key":"10_CR13","first-page":"191","volume":"20","author":"L.G. Khachian","year":"1979","unstructured":"L.G. Khachian, \u201cA polynomial Algorithm in Linear Programming\u201d, Soviet Mathematics Doklady 20 (1979) 191\u2013194.","journal-title":"Soviet Mathematics Doklady"},{"key":"10_CR14","first-page":"610","volume":"83","author":"L. Gouveia","year":"1997","unstructured":"L. Gouveia, \u201cA result on projection for the the Vehicle Routing Problem\u201d, European Journal of Operational Research 83 (1997) 610\u2013624.","journal-title":"European Journal of Operational Research"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0377-2217(94)90360-3","volume":"79","author":"G. Mosheiov","year":"1994","unstructured":"G. Mosheiov, \u201cThe Travelling Salesman Problem with pick-up and delivery\u201d, European Journal of Operational Research 79 (1994) 299\u2013310.","journal-title":"European Journal of Operational Research"},{"key":"10_CR16","unstructured":"D. Naddef, \u201cPolyhedral theory and Branch-and-Cut algorithms for Symmetric TSP\u201d, Chapter 4 in G. Gutin, A. Punnen (Editors), The Traveling Salesman Problem and its Variants, Kluwer, 2001."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"M.W. Padberg, G. Rinaldi, \u201cA branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems\u201d, SIAM Review 33 (1991) 60\u2013100.","journal-title":"SIAM Review"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"M.W.P. Savelsbergh","year":"1995","unstructured":"M.W.P. Savelsbergh, M. Sol, \u201cThe General Pickup and Delivery Problem\u201d, Transportation Science 29 (1995) 17\u201329.","journal-title":"Transportation Science"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"P. Toth, D. Vigo (Editors), \u201cThe Vehicle Routing Problem\u201d, SIAM Discrete Mathematics and its Applications, 2001.","DOI":"10.1137\/1.9780898718515"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization \u2014 Eureka, You Shrink!"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36478-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T13:04:02Z","timestamp":1684069442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36478-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005803","9783540364788"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36478-1_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}