{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T13:08:55Z","timestamp":1776776935341,"version":"3.51.2"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,10,21]],"date-time":"2012-10-21T00:00:00Z","timestamp":1350777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11590-012-0570-9","type":"journal-article","created":{"date-parts":[[2012,10,20]],"date-time":"2012-10-20T06:17:53Z","timestamp":1350713873000},"page":"1569-1581","source":"Crossref","is-referenced-by-count":61,"title":["Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery"],"prefix":"10.1007","volume":"7","author":[{"given":"Anand","family":"Subramanian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur Alves","family":"Pessoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,21]]},"reference":[{"key":"570_CR1","doi-asserted-by":"crossref","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 15, 1\u201331 (2007)","journal-title":"Top"},{"key":"570_CR2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20, 255\u2013282 (1981)","journal-title":"Math. Program."},{"issue":"2","key":"570_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/trsc.1050.0118","volume":"40","author":"M Dell\u2019Amico","year":"2006","unstructured":"Dell\u2019Amico, M., Righini, G., Salani, M.: A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection. Transp. Sci. 40(2), 235\u2013247 (2006)","journal-title":"Transp. Sci."},{"key":"570_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/PL00013346","volume":"23","author":"J Dethloff","year":"2001","unstructured":"Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektr. 23, 79\u201396 (2001)","journal-title":"OR Spektr."},{"key":"570_CR5","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R Fukasawa","year":"2006","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., de Arag\u00e3o, P.M., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Program. 106, 491\u2013511 (2006)","journal-title":"Math. Program."},{"issue":"12","key":"570_CR6","doi-asserted-by":"crossref","first-page":"3215","DOI":"10.1016\/j.cor.2009.02.017","volume":"36","author":"Y Gajpal","year":"2009","unstructured":"Gajpal, Y., Abad, P.: An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Comput. Oper. Res. 36(12), 3215\u20133223 (2009)","journal-title":"Comput. Oper. Res."},{"key":"570_CR7","unstructured":"Lysgaard, J.: A package of separation routines for the capacited vehicle routing problem. Technical report. www.hha.dk\/lys\/CVRPSEP.htm (2003)"},{"key":"570_CR8","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A.N., Eglese, R.W.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Program. 100, 423\u2013445 (2004)","journal-title":"Math. Program."},{"issue":"3","key":"570_CR9","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.cor.2004.07.009","volume":"33","author":"FAT Montan\u00e9","year":"2006","unstructured":"Montan\u00e9, F.A.T., Galv\u00e3o, R.D.: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput. Oper. Res. 33(3), 595\u2013619 (2006)","journal-title":"Comput. Oper. Res."},{"key":"570_CR10","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1057\/palgrave.jors.2600808","volume":"50","author":"S Salhi","year":"1999","unstructured":"Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J. Oper. Res. Soc. 50, 1034\u20131042 (1999)","journal-title":"J. Oper. Res. Soc."},{"issue":"11","key":"570_CR11","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian, A., Drummond, L.M.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899\u20131911 (2010)","journal-title":"Comput. Oper. Res."},{"key":"570_CR12","doi-asserted-by":"crossref","unstructured":"Subramanian, A., Uchoa, E., Ochi, L.S.: New lower bounds for the vehicle routing problem with simultaneous pickup and delivery. In: Proceedings of the 9th International Symposium on Experimental Algorithms (SEA). Lecture Notes in Computer Science, pp. 276\u2013287 (2010)","DOI":"10.1007\/978-3-642-13193-6_24"},{"key":"570_CR13","doi-asserted-by":"crossref","unstructured":"Subramanian, A., Uchoa, E., Ochi, L.S.: New lower bounds for the vehicle routing problem with simultaneous pickup and delivery. Technical Report 01\/10, UFF, Niter\u00f3i, Brazil (2010)","DOI":"10.1007\/978-3-642-13193-6_24"},{"issue":"5","key":"570_CR14","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/j.orl.2011.06.012","volume":"39","author":"A Subramanian","year":"2011","unstructured":"Subramanian, A., Uchoa, E., Pessoa, A.A., Ochi, L.S.: Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper. Res. Lett. 39(5), 338\u2013341 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"570_CR15","doi-asserted-by":"crossref","first-page":"2717","DOI":"10.1016\/j.eswa.2010.08.061","volume":"38","author":"EE Zachariadis","year":"2011","unstructured":"Zachariadis, E.E., Kiranoudis, C.T.: A local search metaheuristic algorithm for the vehicle routing problem with simultaneous pick-ups and deliveries. Expert Syst. Appl. 38(3), 2717\u20132726 (2011)","journal-title":"Expert Syst. Appl."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0570-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0570-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0570-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T17:23:12Z","timestamp":1562260992000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0570-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,21]]},"references-count":15,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["570"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0570-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,21]]}}}