{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T21:59:32Z","timestamp":1781387972660,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540309352","type":"print"},{"value":"9783540324263","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_105","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T03:24:24Z","timestamp":1133493864000},"page":"1061-1070","source":"Crossref","is-referenced-by-count":8,"title":["The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Lim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhou","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"105_CR1","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1002\/(SICI)1520-6750(199909)46:6<654::AID-NAV4>3.0.CO;2-A","volume":"56","author":"S. Anily","year":"1999","unstructured":"Anily, S., Bramel, J.: Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Research Logistics\u00a056, 654\u2013670 (1999)","journal-title":"Naval Research Logistics"},{"issue":"1","key":"105_CR2","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1137\/S0097539797323108","volume":"29","author":"S. Anily","year":"1999","unstructured":"Anily, S., Gendreau, M., Laporte, G.: The swapping problem on a line. SIAM Jounral on Computing\u00a029(1), 327\u2013335 (1999)","journal-title":"SIAM Jounral on Computing"},{"key":"105_CR3","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1002\/net.3230220408","volume":"22","author":"S. Anily","year":"1992","unstructured":"Anily, S., Hassin, R.: The swapping problem. Networks\u00a022, 419\u2013433 (1992)","journal-title":"Networks"},{"issue":"2","key":"105_CR4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1023\/A:1011461300596","volume":"5","author":"T. Asano","year":"2000","unstructured":"Asano, T., Katoh, N., Kawashima, K.: A new approximation algorithm for the capacitated vehicle routing problems on a tree. Journal of Combinatorial Optimization\u00a05(2), 213\u2013231 (2000)","journal-title":"Journal of Combinatorial Optimization"},{"key":"105_CR5","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1057\/palgrave.jors.2600747","volume":"50","author":"C. Basnet","year":"1999","unstructured":"Basnet, C., Foulds, L.R., Wilson, J.M.: Heuristics for vehicle routing on tree-like networks. Journal of the Operational Research Society\u00a050, 627\u2013635 (1999)","journal-title":"Journal of the Operational Research Society"},{"issue":"6","key":"105_CR6","doi-asserted-by":"publisher","first-page":"2133","DOI":"10.1137\/S0097539795295468","volume":"28","author":"P. Chalasani","year":"1999","unstructured":"Chalasani, P., Motwani, R.: Approximating capacitated routing and delivery problems. SIAM J. Comput.\u00a028(6), 2133\u20132149 (1999)","journal-title":"SIAM J. Comput."},{"key":"105_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/0222005","volume":"22","author":"G.N. Frederickson","year":"1993","unstructured":"Frederickson, G.N.: Notes on the complexity of a simple transportation problem. SIAM J. Comput.\u00a022, 57\u201361 (1993)","journal-title":"SIAM J. Comput."},{"key":"105_CR8","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1137\/0221066","volume":"21","author":"G.N. Frederickson","year":"1992","unstructured":"Frederickson, G.N., Guan, D.: Preemptive ensemble motion planning on a tree. SIAM J. Comput.\u00a021, 1130\u20131152 (1992)","journal-title":"SIAM J. Comput."},{"key":"105_CR9","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/0207017","volume":"7","author":"G.N. Frederickson","year":"1978","unstructured":"Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM J. Comput.\u00a07, 178\u2013193 (1978)","journal-title":"SIAM J. Comput."},{"key":"105_CR10","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"105_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/3-540-49381-6_42","volume-title":"Algorithms and Computation","author":"S. Hamaguchi","year":"1998","unstructured":"Hamaguchi, S., Katoh, N.: A capacitated vehicle routing problem on a tree. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol.\u00a01533, pp. 397\u2013407. Springer, Heidelberg (1998)"},{"issue":"2","key":"105_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/trsc.1030.0086","volume":"38","author":"H. Hernandez-Perez","year":"2004","unstructured":"Hernandez-Perez, H., Salazar-Gonzalez, J.J.: Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Science\u00a038(2), 245\u2013255 (2004)","journal-title":"Transportation Science"},{"key":"105_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/3-540-57568-5_280","volume-title":"Algorithms and Computation","author":"Y. Karuno","year":"1993","unstructured":"Karuno, Y., Nagamochi, H., Ibaraki, T.: Vehicle scheduling on a tree with release and handling times. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol.\u00a0762, pp. 486\u2013495. Springer, Heidelberg (1993)"},{"issue":"2","key":"105_CR14","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1287\/opre.39.4.616","volume":"39","author":"M. Labbe","year":"1991","unstructured":"Labbe, M., Laporte, G., Mercure, H.: Capacitated vehicle routing problems on trees. Operations Research\u00a039(2), 616\u2013622 (1991)","journal-title":"Operations Research"},{"key":"105_CR15","doi-asserted-by":"crossref","unstructured":"Lim, A., Wang, F., Xu, Z.: A 2-approximation algorithm for capacitated traveling salesman problem with pickup and delivery on a tree (complete version), Working Paper, Hong Kong University of Science and Technology (September 2005)","DOI":"10.1007\/11602613_105"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_105.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:02:30Z","timestamp":1619492550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_105"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11602613_105","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}