{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T09:35:02Z","timestamp":1782812102346,"version":"3.54.5"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T00:00:00Z","timestamp":1129075200000},"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":[[2006,2]]},"DOI":"10.1007\/s10107-005-0652-x","type":"journal-article","created":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T15:10:17Z","timestamp":1129129817000},"page":"251-274","source":"Crossref","is-referenced-by-count":95,"title":["Projection results for vehicle routing"],"prefix":"10.1007","volume":"105","author":[{"given":"Adam N.","family":"Letchford","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":[[2005,10,12]]},"reference":[{"key":"652_CR1","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, algorithms and applications. Prentice-Hall, 1993"},{"key":"652_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q","volume":"36","author":"Ascheuer","year":"2000","unstructured":"Ascheuer, N., Fischetti, M., Gr\u00f6tschel, M.: A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36, 69\u201379 (2000)","journal-title":"Networks"},{"key":"652_CR3","unstructured":"Augerat, P.: Approche Poly\u00e8drale du Probl\u00e8me de Tourn\u00e9es de V\u00e9hicles. PhD thesis, Institut National Polytechnique de Grenoble, France, 1995"},{"key":"652_CR4","unstructured":"Augerat, P., Belenguer, J.M., Benavent, E., Corber\u00e1n, A., Naddef, D., Rinaldi, G.: Computational results with a branch-and-cut code for the capacitated vehicle routing problem. Research report RR949-M, ARTEMIS-IMAG, France (1995)"},{"key":"652_CR5","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"Baldacci","year":"2004","unstructured":"Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Operations Research 52, 723\u2013738 (2004)","journal-title":"Operations Research"},{"key":"652_CR6","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s101070100209","volume":"91","author":"Bauer","year":"2002","unstructured":"Bauer, P., Linderoth, J.T., Savelsbergh, M.W.P.: A branch and cut approach to the cardinality constrained circuit problem. Math. Program. 91, 307\u2013348 (2002)","journal-title":"Math. Program."},{"key":"652_CR7","unstructured":"Bixby, A.E., Coullard, C., Simchi-Levi, D.: The capacitated prize-collecting traveling salesman problem. Working paper, Department of Industrial Engineering and Engineering Management, Northwestern University, 1997"},{"key":"652_CR8","unstructured":"Blasum, U., Hochst\u00e4ttler, W.: Application of the branch and cut method to the vehicle routing problem. Working Paper, Zentrum fur Angewandte Informatik, Koln, 2000"},{"key":"652_CR9","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Desaulniers, G., Desrosiers, J., Solomon, M.M. VRP with time windows. In: Toth, P., Vigo, D. (eds.), The Vehicle Routing Problem. SIAM, 2001","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"652_CR10","unstructured":"Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F.: VRP with pickup and delivery. In: Toth, P., Vigo D. (eds.), The Vehicle Routing Problem. SIAM, 2001"},{"key":"652_CR11","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time-constrained routing and scheduling. In: Ball M.O. et al. (eds.), Network Routing. Handbooks in OR\/MS 8, North-Holland, Amsterdam, 1995","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"652_CR12","doi-asserted-by":"crossref","unstructured":"Eglese, R.W., Letchford, A.N.: Polyhedral theory for arc routing problems. In: Dror, M. (ed.), Arc Routing: Theory, Solutions and Applications. Kluwer Academic Publishers, 2000","DOI":"10.1007\/978-1-4615-4495-1_6"},{"key":"652_CR13","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/S1052623493254455","volume":"6","author":"Ferreira","year":"1996","unstructured":"Ferreira, C.E., Martin, A., Weismantel, R.: Solving multiple knapsack problems by cutting planes. SIAM J. Opt. 6, 858\u2013877 (1996)","journal-title":"SIAM J. Opt."},{"key":"652_CR14","unstructured":"Fischetti, M., Salazar-Gonz\u00e1lez, J.J., Toth, P.: Experiments with a multi-commodity formulation for the symmetric capacitated vehicle routing problem. In Proceedings of the 3rd Meeting of the EURO Working Group on Transportation, Barcelona, 1995, pp. 169\u2013173"},{"key":"652_CR15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"Fisher","year":"1981","unstructured":"Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for the vehicle routing problem. Networks 11, 109\u2013124 (1981)","journal-title":"Networks"},{"key":"652_CR16","doi-asserted-by":"crossref","unstructured":"Fukasawa, R., Lysgaard, J., de Arag\u00e3o, M.P., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. In: Nemhauser, G., Bienstock, D. (eds.), Integer Programming and Combinatorial Optimization 10. Lecture Notes in Computer Science 3064, Springer, Berlin Heidelberg, 2004, pp. 1\u201315","DOI":"10.1007\/978-3-540-25960-2_1"},{"key":"652_CR17","unstructured":"Gavish, B., Graves, S.: The traveling salesman problem and related problems. Working Paper, Graduate School of Management, University of Rochester, New York, 1979"},{"key":"652_CR18","unstructured":"Gavish, B., Graves, S.: Scheduling and routing in transportation and distribution systems: formulations and new relaxations. Working Paper, Graduate School of Management, University of Rochester, New York, 1982"},{"key":"652_CR19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1002\/net.3230230104","volume":"23","author":"Goemans","year":"1993","unstructured":"Goemans, M.X., Myung, Y.S.: A catalog of steiner tree formulations. Networks 23, 19\u201328 (1993)","journal-title":"Networks"},{"key":"652_CR20","doi-asserted-by":"crossref","unstructured":"Gouveia, L. A result on projection for the vehicle routing problem. European J. Oper. Res. 85, 610\u2013624 (1995)","DOI":"10.1016\/0377-2217(94)00025-8"},{"key":"652_CR21","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.J.: Geometric Algorithms in Combinatorial Optimisation. Springer, 1988","DOI":"10.1007\/978-3-642-97881-4"},{"key":"652_CR22","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: The one-commodity pickup-and-delivery traveling salesman problem. In: J\u00fcnger, M., Reinelt, G., Rinaldi, G. (eds.), Eureka! You Shrink, Lecture Notes in Computer Science 2570, Springer, Berlin Heidelberg, 2003, pp. 89\u2013104"},{"key":"652_CR23","unstructured":"Irnich, S., Villeneuve, D.: The shortest path problem with resource constraints and k-cycle elimination with k \u2265 3. Working Paper, RWTH Aachen, 2003"},{"key":"652_CR24","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/trsc.33.1.101","volume":"33","author":"Kohl","year":"1999","unstructured":"Kohl, N., Desrosiers, J., Madsen, O.B.G., Solomon, M.M., Soumis, F.: 2-path cuts for the vehicle routing problem with time windows. Transportation Science 33, 101\u2013116 (1999)","journal-title":"Transportation Science"},{"key":"652_CR25","doi-asserted-by":"crossref","unstructured":"Langevin, A., Soumis, F., Desrochers, J. Classification of traveling salesman formulations. Oper. Res. Lett. 9, 127\u2013132 (1990)","DOI":"10.1016\/0167-6377(90)90052-7"},{"key":"652_CR26","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1002\/net.3230230706","volume":"23","author":"Langevin","year":"1993","unstructured":"Langevin, A., Desrochers, M., Desrosiers, J., G\u00e9linas, S., Soumis, F.: A two commodity flow formulation for the travelling salesman and makespan problems with time windows. Networks 23, 631\u2013640 (1993)","journal-title":"Networks"},{"key":"652_CR27","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01720015","volume":"5","author":"Laporte","year":"1983","unstructured":"Laporte, G., Nobert, Y.: A branch and bound algorithm for the capacitated vehicle routing problem. OR Spektrum 5, 77\u201385 (1983)","journal-title":"OR Spektrum"},{"key":"652_CR28","first-page":"147","volume":"31","author":"Laporte","year":"1987","unstructured":"Laporte, G., Nobert, Y.: Exact algorithms for the vehicle routing problem. Ann. Discr. Math. 31, 147\u2013184 (1987)","journal-title":"Ann. Discr. Math."},{"key":"652_CR29","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1287\/opre.33.5.1050","volume":"33","author":"Laporte","year":"1985","unstructured":"Laporte, G., Nobert, Y., Desrochers, M.: Optimal routing under capacity and distance restrictions. Operations Research 33, 1050\u20131073 (1985)","journal-title":"Operations Research"},{"key":"652_CR30","unstructured":"Letchford, A.N., Eglese, R.W.: New cutting-planes for vehicle routing problems. Presented at CO96, Imperial College, London, 1996"},{"key":"652_CR31","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-002-0336-8","volume":"94","author":"Letchford","year":"2002","unstructured":"Letchford, A.N., Eglese, R.W., Lysgaard, J.: Multistars, partial multistars and the capacitated vehicle routing problem. Math. Program. 94, 21\u201340 (2002)","journal-title":"Math. Program."},{"key":"652_CR32","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"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."},{"key":"652_CR33","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1023\/A:1018989130169","volume":"69","author":"Maffioli","year":"1997","unstructured":"Maffioli, F., Sciomachen, A.: A mixed-integer model for solving ordering problems with side constraints. Ann. Operations Res. 69, 277\u2013297 (1997)","journal-title":"Ann. Operations Res."},{"key":"652_CR34","unstructured":"Naddef, D., Rinaldi, G.: Branch-and-cut algorithms for the capacitated VRP. In: Toth, P., Vigo, D. (eds.), The Vehicle Routing Problem. SIAM, 2001"},{"key":"652_CR35","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01582894","volume":"52","author":"Padberg","year":"1991","unstructured":"Padberg, M., Sung, T.Y.: An analytical comparison of different formulations of the travelling salesman problem. Math. Program. 52, 315\u2013357 (1991)","journal-title":"Math. Program."},{"key":"652_CR36","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","volume":"28","author":"Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The complexity of facets (and some facets of complexity). J. Comp. System Sci. 28, 244\u2013259 (1984)","journal-title":"J. Comp. System Sci."},{"key":"652_CR37","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230050405","volume":"5","author":"Picard","year":"1975","unstructured":"Picard, J.C., Ratliff, H.D.: Minimum cuts and related problems. Networks 5, 357\u2013370 (1975)","journal-title":"Networks"},{"key":"652_CR38","unstructured":"Toth, P., Vigo, D.: An overview of vehicle routing problems. In: Toth, P., Vigo, D. (eds.), The Vehicle Routing Problem. SIAM, 2001"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0652-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0652-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0652-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T08:02:02Z","timestamp":1586505722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0652-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,12]]},"references-count":38,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["652"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0652-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,12]]}}}