{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T05:32:58Z","timestamp":1785475978603,"version":"3.56.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,7,22]],"date-time":"2008-07-22T00:00:00Z","timestamp":1216684800000},"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":[[2010,2]]},"DOI":"10.1007\/s10107-008-0234-9","type":"journal-article","created":{"date-parts":[[2008,7,21]],"date-time":"2008-07-21T10:21:56Z","timestamp":1216635716000},"page":"269-305","source":"Crossref","is-referenced-by-count":61,"title":["The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm"],"prefix":"10.1007","volume":"121","author":[{"given":"Irina","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Ropke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Fran\u00e7ois","family":"Cordeau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilbert","family":"Laporte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,7,22]]},"reference":[{"key":"234_CR1","doi-asserted-by":"crossref","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. Comput. Optim. Appl. 17, 61\u201384 (2000)","journal-title":"Comput. Optim. Appl."},{"key":"234_CR2","first-page":"241","volume":"68","author":"E. Balas","year":"1995","unstructured":"Balas E., Fischetti M., Pulleyblank W.R.: The precedence-constrained asymmetric traveling salesman polytope. Math. Program. 68, 241\u2013265 (1995)","journal-title":"Math. Program."},{"key":"234_CR3","unstructured":"Christof, T., L\u00f6bel, A.: Porta\u2014a polyhedron representation and transformation algorithm. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/PORTA\/index.html . ZIB, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin."},{"key":"234_CR4","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1287\/opre.1060.0283","volume":"54","author":"J.-F. Cordeau","year":"2006","unstructured":"Cordeau J.-F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54, 573\u2013586 (2006)","journal-title":"Oper. Res."},{"key":"234_CR5","unstructured":"Cordeau, J.-F., Laporte, G., Ropke, S.: Recent models and algorithms for one-to-one pickup and delivery problems. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Vehicle Routing Problem, Latest Advances and Challenges. Springer, Boston (2008) (forthcoming)"},{"key":"234_CR6","unstructured":"Dumitrescu, I.: Polyhedral results for the pickup and delivery travelling salesman problem. Technical Report CIRRELT-2008-07, Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation (2008). http:\/\/www.crt.umontreal.ca\/~irina\/CRTdumitrescu.pdf ."},{"issue":"3","key":"234_CR7","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/inte.22.3.100","volume":"22","author":"M.T. Fiala Timlin","year":"1992","unstructured":"Fiala Timlin M.T., Pulleyblank W.R.: Precedence constrained routing and helicopter scheduling: Heuristic design. Interfaces 22(3), 100\u2013111 (1992)","journal-title":"Interfaces"},{"key":"234_CR8","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/0305-0548(95)00036-4","volume":"23","author":"M. Gendreau","year":"1996","unstructured":"Gendreau M., Hertz A., Laporte G.: The traveling salesman problem with backhauls. Comp. Oper. Res. 23, 501\u2013508 (1996)","journal-title":"Comp. Oper. Res."},{"key":"234_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(93)E0292-6","volume":"83","author":"P. Healy","year":"1995","unstructured":"Healy P., Moll R.: A new extension of local search applied to the dial-a-ride problem. Eur. J. Oper. Res. 83, 83\u2013104 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"234_CR10","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., Salazar-Gonz\u00e1lez J.-J.: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. Discrete Appl. Math. 145, 126\u2013139 (2004)","journal-title":"Discrete Appl. Math."},{"key":"234_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","volume-title":"Column Generation","author":"S. Irnich","year":"2005","unstructured":"Irnich S., Desaulniers G.: Shortest path problems with resource constraints. In: Desaulniers, G., Desrosiers, J., Solomon, M.M.(eds) Column Generation, pp. 33\u201365. Springer, Boston (2005)"},{"key":"234_CR12","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0377-2217(85)90257-7","volume":"22","author":"B. Kalantari","year":"1985","unstructured":"Kalantari B., Hill A.V., Arora S.R.: An algorithm for the traveling salesman problem with pickup and delivery customers. Eur. J. Oper. Res. 22, 377\u2013386 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"234_CR13","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1287\/trsc.1030.0040","volume":"38","author":"Q. Lu","year":"2004","unstructured":"Lu Q., Dessouky M.: An exact algorithm for the multiple vehicle pickup and delivery problem. Transportation Sci. 38, 503\u2013514 (2004)","journal-title":"Transportation Sci."},{"key":"234_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, Chichester (1988)"},{"key":"234_CR15","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt G.: TSPLIB\u2014a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"234_CR16","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/S0305-0548(00)00109-X","volume":"29","author":"J. Renaud","year":"2002","unstructured":"Renaud J., Boctor F.F., Laporte G.: Pertubation heuristics for the pickup and delivery traveling salesman problem. Comp. Oper. Res. 29, 1129\u20131141 (2002)","journal-title":"Comp. Oper. Res."},{"key":"234_CR17","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","volume":"27","author":"J. Renaud","year":"2000","unstructured":"Renaud J., Boctor F.F., Ouenniche J.: A heuristic for the pickup and delivery traveling salesman problem. Comp. Oper. Res. 27, 905\u2013916 (2000)","journal-title":"Comp. Oper. Res."},{"key":"234_CR18","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S. Ropke","year":"2007","unstructured":"Ropke S., Cordeau J.-F., Laporte G.: Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49, 258\u2013272 (2007)","journal-title":"Networks"},{"key":"234_CR19","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S. Ropke","year":"2006","unstructured":"Ropke S., Pisinger D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40, 455\u2013472 (2006)","journal-title":"Transportation Sci."},{"key":"234_CR20","unstructured":"Ruland, K.S.: Polyhedral Solution to the Pickup and Delivery Problem. PhD thesis, Sever Institute of Washington University (1994)"},{"key":"234_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0898-1221(97)00090-4","volume":"33","author":"K.S. Ruland","year":"1997","unstructured":"Ruland K.S., Rodin E.Y.: The pickup and delivery problem: Faces and branch-and-cut algorithm. Comp. Math. Appl. 33, 1\u201313 (1997)","journal-title":"Comp. Math. Appl."},{"key":"234_CR22","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0377-2217(90)90091-O","volume":"47","author":"M.W.P. Savelsbergh","year":"1990","unstructured":"Savelsbergh M.W.P.: An efficient implementation of local search algorithms for constrained routing problems. Euro. J. Oper. Res. 47, 75\u201385 (1990)","journal-title":"Euro. J. Oper. Res."},{"key":"234_CR23","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: CP-98 (Fourth International Conference on Principles and Practice of Constraint Programming), pp. 417\u2013431. Lecture Notes in Computer Science, vol. 1520. Springer, Berlin (1998)","DOI":"10.1007\/3-540-49481-2_30"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0234-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0234-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0234-9","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-0234-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,22]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["234"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0234-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,22]]}}}