{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T07:26:52Z","timestamp":1761982012109,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319075563"},{"type":"electronic","value":"9783319075570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07557-0_33","type":"book-chapter","created":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T11:50:30Z","timestamp":1400327430000},"page":"393-403","source":"Crossref","is-referenced-by-count":22,"title":["Improved Branch-Cut-and-Price for Capacitated Vehicle Routing"],"prefix":"10.1007","author":[{"given":"Diego","family":"Pecin","sequence":"first","affiliation":[]},{"given":"Artur","family":"Pessoa","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Poggi","sequence":"additional","affiliation":[]},{"given":"Eduardo","family":"Uchoa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"33_CR1","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R. Baldacci","year":"2008","unstructured":"Baldacci, R., Christofides, N., Mingozzi, A.: An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Mathematical Programming\u00a0115(2), 351\u2013385 (2008)","journal-title":"Mathematical Programming"},{"issue":"5","key":"33_CR2","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1287\/opre.1110.0975","volume":"59","author":"R. Baldacci","year":"2011","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: New route relaxation and pricing strategies for the vehicle routing problem. Operations Research\u00a059(5), 1269\u20131283 (2011)","journal-title":"Operations Research"},{"key":"33_CR3","doi-asserted-by":"publisher","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. Prog.\u00a020, 255\u2013282 (1981)","journal-title":"Math. Prog."},{"key":"33_CR4","unstructured":"Contardo, C.: A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Technical report, Archipel-UQAM 5078, Universit\u00e9 du Qu\u00e9bec \u00e0 Montr\u00e9al, Canada (2012)"},{"issue":"3","key":"33_CR5","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa, R., Longo, H., Lysgaard, J., Poggi de Arag\u00e3o, M., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming\u00a0106(3), 491\u2013511 (2006)","journal-title":"Mathematical Programming"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Golden, B., Wasil, E., Kelly, J., Chao, I.: The impact of metaheuristics on solving the vehicle routing problem: Algorithms, problem sets, and computational results. In: Fleet Management and Logistics, pp. 33\u201356. Springer (1998)","DOI":"10.1007\/978-1-4615-5755-5_2"},{"issue":"2","key":"33_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1287\/ijoc.1090.0341","volume":"22","author":"S. Irnich","year":"2010","unstructured":"Irnich, S., Desaulniers, G., Desrosiers, J., Hadjar, A.: Path-reduced costs for eliminating arcs in routing and scheduling. INFORMS Journal on Computing\u00a022(2), 297\u2013313 (2010)","journal-title":"INFORMS Journal on Computing"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M. Jepsen","year":"2008","unstructured":"Jepsen, M., Petersen, B., Spoorendonk, S., Pisinger, D.: Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Research\u00a056, 497\u2013511 (2008)","journal-title":"Oper. Research"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J. Lysgaard","year":"2004","unstructured":"Lysgaard, J., Letchford, A., Eglese, R.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming\u00a0100, 423\u2013445 (2004)","journal-title":"Mathematical Programming"},{"key":"33_CR10","unstructured":"Martinelli, R., Pecin, D., Poggi, M.: Efficient elementary and restricted non-elementary route pricing for routing problems (2012) (submitted)"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Pessoa, A., Poggi de Arag\u00e3o, M., Uchoa, E.: Robust branch-cut-and-price algorithms for vehicle routing problems. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 297\u2013325. Springer (2008)","DOI":"10.1007\/978-0-387-77778-8_14"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-642-38527-8_31","volume-title":"Experimental Algorithms","author":"A. Pessoa","year":"2013","unstructured":"Pessoa, A., Sadykov, R., Uchoa, E., Vanderbeck, F.: In-out separation and column generation stabilization by dual price smoothing. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol.\u00a07933, pp. 354\u2013365. Springer, Heidelberg (2013)"},{"issue":"3-4","key":"33_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s12532-010-0019-z","volume":"2","author":"A. Pessoa","year":"2010","unstructured":"Pessoa, A., Uchoa, E., Poggi de Arag\u00e3o, M., Rodrigues, R.: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. Mathematical Programming Computation\u00a02(3-4), 259\u2013290 (2010)","journal-title":"Mathematical Programming Computation"},{"key":"33_CR14","unstructured":"Poggi de Arag\u00e3o, M., Uchoa, E.: Integer program reformulation for robust branch-and-cut-and-price. In: Annals of Mathematical Programming in Rio, B\u00fazios, Brazil, pp. 56\u201361 (2003)"},{"issue":"3","key":"33_CR15","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","volume":"3","author":"G. Righini","year":"2006","unstructured":"Righini, G., Salani, M.: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optimization\u00a03(3), 255\u2013273 (2006)","journal-title":"Discrete Optimization"},{"key":"33_CR16","unstructured":"R\u00f8pke, S.: Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. Presentation in Column Generation 2012 (2012)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07557-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T21:20:29Z","timestamp":1558905629000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07557-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319075563","9783319075570"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07557-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}