{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T10:29:08Z","timestamp":1778581748242,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,30]],"date-time":"2008-01-30T00:00:00Z","timestamp":1201651200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1007\/s10107-008-0206-0","type":"journal-article","created":{"date-parts":[[2008,1,29]],"date-time":"2008-01-29T12:42:59Z","timestamp":1201610579000},"page":"169-194","source":"Crossref","is-referenced-by-count":10,"title":["On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands"],"prefix":"10.1007","volume":"119","author":[{"given":"Fran\u00e7ois","family":"Louveaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan-Jos\u00e9","family":"Salazar-Gonz\u00e1lez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,1,30]]},"reference":[{"key":"206_CR1","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1002\/(SICI)1520-6750(199909)46:6<654::AID-NAV4>3.0.CO;2-A","volume":"46","author":"S. Anily","year":"1999","unstructured":"Anily S. and Bramel J. (1999). Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries. Naval Res. Logis. 46: 654\u2013670","journal-title":"Naval Res. Logis."},{"key":"206_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.20063","volume":"46","author":"P. Beraldi","year":"2005","unstructured":"Beraldi P., Ghiani G., Laporte G. and Musmanno R. (2005). Efficient neighbourhood search for the probabilistic pickup and delivery travelling salesman problem. Networks 46: 195\u2013198","journal-title":"Networks"},{"issue":"6","key":"206_CR3","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1287\/opre.38.6.1019","volume":"38","author":"D. Bertsimas","year":"1990","unstructured":"Bertsimas D., Jaillet P. and Odoni A. (1990). A priori optimization. Oper. Res. 38(6): 1019\u20131033","journal-title":"Oper. Res."},{"key":"206_CR4","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10107-003-0396-4","volume":"98","author":"D. Bertsimas","year":"2003","unstructured":"Bertsimas D. and Sim M. (2003). Robust discrete Optimization and network flows. Math. Program. B 98: 49\u201371","journal-title":"Math. Program. B"},{"key":"206_CR5","doi-asserted-by":"crossref","first-page":"2133","DOI":"10.1137\/S0097539795295468","volume":"28","author":"P. Chalasani","year":"1999","unstructured":"Chalasani P. and Motwani R. (1999). Approximating capacitated routing and delivery problems. SIAM J. Comput. 28: 2133\u20132149","journal-title":"SIAM J. Comput."},{"key":"206_CR6","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: The multi-commodity Travelling Salesman Problem with Pickups and Deliveries, working paper, University of La Laguna (2004)"},{"key":"206_CR7","doi-asserted-by":"crossref","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. and Salazar-Gonz\u00e1lez J.J. (2004). A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Appl. Math. 145: 126\u2013139","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"206_CR8","doi-asserted-by":"crossref","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. and Salazar-Gonz\u00e1lez J.J. (2004). Heuristics for the one-commodity pickup-and-delivery traveling salesman problem. Transportation Sci. 38(2): 245\u2013255","journal-title":"Transportation Sci."},{"issue":"4","key":"206_CR9","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20209","volume":"50","author":"H. Hern\u00e1ndez-P\u00e9rez","year":"2007","unstructured":"Hern\u00e1ndez-P\u00e9rez H. and Salazar-Gonz\u00e1lez J.J. (2007). The one-commodity pickup-and-delivery traveling salesman problem: inequalities and algorithms. Networks 50(4): 258\u2013272","journal-title":"Networks"},{"key":"206_CR10","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1023\/A:1018995927636","volume":"86","author":"C. Hjorring","year":"1999","unstructured":"Hjorring C. and Holt J. (1999). New optimality cuts for a single-vehicle stochastic routing problem. Ann. Oper. Res. 86: 569\u2013584","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"206_CR11","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1287\/opre.36.6.929","volume":"36","author":"P. Jaillet","year":"1988","unstructured":"Jaillet P. (1988). A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Oper. Res. 36(6): 929\u2013936","journal-title":"Oper. Res."},{"issue":"3","key":"206_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.26.3.161","volume":"26","author":"G. Laporte","year":"1992","unstructured":"Laporte G., Louveaux F. and Mercure H. (1992). The vehicle routing problem with stochastic travel times. Transportation Sci. 26(3): 161\u2013170","journal-title":"Transportation Sci."},{"issue":"3","key":"206_CR13","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1287\/opre.42.3.543","volume":"42","author":"G. Laporte","year":"1994","unstructured":"Laporte G., Louveaux F. and Mercure H. (1994). A priori optimization of the probabilistic traveling salesman problem. Oper. Res. 42(3): 543\u2013549","journal-title":"Oper. Res."},{"key":"206_CR14","doi-asserted-by":"crossref","unstructured":"Powell, W.B., Jaillet, P., Odoni, A.: Stochastic and dynamic networks and routing. In: Ball, M.O., Magnanti, T.L., Monma, C.L., Nemhauser, G.L. (eds) Network Routing Handbooks in Operations Research and Management Science 8, pp 141\u2013295 (1995)","DOI":"10.1016\/S0927-0507(05)80107-0"},{"key":"206_CR15","volume-title":"Combinatorial Methods in the Theory of Stochastic Processes","author":"L. Takacs","year":"1967","unstructured":"Takacs L. (1967). Combinatorial Methods in the Theory of Stochastic Processes. Wiley, New York"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0206-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0206-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0206-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:05Z","timestamp":1559123405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0206-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,30]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["206"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0206-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,30]]}}}