{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T04:30:17Z","timestamp":1770697817164,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,9,26]],"date-time":"2020-09-26T00:00:00Z","timestamp":1601078400000},"content-version":"vor","delay-in-days":483,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003151","name":"Fonds de Recherche du Qu\u00e9bec - Nature et Technologies","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003151","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003151","name":"Fonds de Recherche du Qu\u00e9bec - Nature et Technologies","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003151","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s13676-017-0112-9","type":"journal-article","created":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T06:13:27Z","timestamp":1506320007000},"page":"147-168","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":12,"title":["Selective pricing in branch-price-and-cut algorithms for vehicle routing"],"prefix":"10.1016","volume":"8","author":[{"given":"Guy","family":"Desaulniers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Pecin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7595-3904","authenticated-orcid":false,"given":"Claudio","family":"Contardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1007\/s13676-017-0112-9_bib1","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1287\/opre.1110.0975","article-title":"New route relaxation and pricing strategies for the vehicle routing problem","volume":"59","author":"Baldacci","year":"2011","journal-title":"Oper Res"},{"issue":"3","key":"10.1007\/s13676-017-0112-9_bib2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price: column generation for solving huge integer programs","volume":"46","author":"Barnhart","year":"1998","journal-title":"Oper Res"},{"key":"10.1007\/s13676-017-0112-9_bib3","series-title":"Vehicle routing: problems, methods, and applications, MOS-SIAM series on optimization","first-page":"161","article-title":"Pickup-and-delivery problems for goods transportation","volume":"vol 6","author":"Battarra","year":"2014"},{"issue":"4","key":"10.1007\/s13676-017-0112-9_bib4","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1287\/trsc.2014.0535","article-title":"Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and LIFO loading","volume":"49","author":"Cherkesly","year":"2015","journal-title":"Transp Sci"},{"issue":"3","key":"10.1007\/s13676-017-0112-9_bib5","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/trsc.1070.0223","article-title":"Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows","volume":"42","author":"Desaulniers","year":"2008","journal-title":"Transp Sci"},{"key":"10.1007\/s13676-017-0112-9_bib6","series-title":"Vehicle routing: problems, methods, and applications, MOS-SIAM series on optimization","first-page":"119","article-title":"The vehicle routing problem with time windows","volume":"vol 5","author":"Desaulniers","year":"2014"},{"key":"10.1007\/s13676-017-0112-9_bib7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","article-title":"A new optimization algorithm for the vehicle routing problem with time windows","volume":"40","author":"Desrochers","year":"1992","journal-title":"Oper Res"},{"key":"10.1007\/s13676-017-0112-9_bib8","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1002\/net.3230140406","article-title":"Routing with time windows by column generation","volume":"14","author":"Desrosiers","year":"1984","journal-title":"Networks"},{"key":"10.1007\/s13676-017-0112-9_bib9","series-title":"Vehicle routing: problems, methods, and applications, MOS-SIAM series on optimization","first-page":"193","article-title":"Pickup-and-delivery problems for people transportation","volume":"vol 7","author":"Doerner","year":"2014"},{"key":"10.1007\/s13676-017-0112-9_bib10","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.42.5.977","article-title":"Note on the complexity of the shortest path models for column generation in VRPTW","volume":"42","author":"Dror","year":"1994","journal-title":"Oper Res"},{"key":"10.1007\/s13676-017-0112-9_bib11","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","article-title":"An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems","volume":"44","author":"Feillet","year":"2004","journal-title":"Networks"},{"key":"10.1007\/s13676-017-0112-9_bib12","first-page":"35","article-title":"A parallel two-phase metaheuristic for routing problems with time windows","volume":"18","author":"Gehring","year":"2001","journal-title":"Asia Pac J Oper Res"},{"key":"10.1007\/s13676-017-0112-9_bib13","series-title":"Vehicle routing: problems, methods, and applications, MOS-SIAM series on optimization","first-page":"213","article-title":"Stochastic vehicle routing problems","volume":"vol 8","author":"Gendreau","year":"2014"},{"key":"10.1007\/s13676-017-0112-9_bib14","series-title":"Column generation","first-page":"33","article-title":"Shortest path problems with resource constraints","author":"Irnich","year":"2005"},{"issue":"3","key":"10.1007\/s13676-017-0112-9_bib15","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/ijoc.1040.0117","article-title":"The shortest path problem with resource constraints and kcycle elimination for k\u22653","volume":"18","author":"Irnich","year":"2006","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13676-017-0112-9_bib16","series-title":"Vehicle routing: problems, methods, and applications, MOS-SIAM series on optimization","first-page":"241","article-title":"Four variants of the vehicle routing problem","volume":"vol 9","author":"Irnich","year":"2014"},{"issue":"2","key":"10.1007\/s13676-017-0112-9_bib17","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","article-title":"Subset-row inequalities applied to the vehicle-routing problem with time windows","volume":"56","author":"Jepsen","year":"2008","journal-title":"Oper Res"},{"issue":"2","key":"10.1007\/s13676-017-0112-9_bib18","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01720015","article-title":"A branch and bound algorithm for the capacitated vehicle routing problem","volume":"5","author":"Laporte","year":"1983","journal-title":"Oper Res Spectr"},{"issue":"6","key":"10.1007\/s13676-017-0112-9_bib19","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","article-title":"Selected topics in column generation","volume":"53","author":"L\u00fcbbecke","year":"2005","journal-title":"Oper Res"},{"key":"10.1007\/s13676-017-0112-9_bib20","unstructured":"Pecin D, Contardo C, Desaulniers G, Uchoa E (2016) New enhancements for the exact solution of the vehicle routing problem with time windows. Technical Report G-2016-13, Cahiers du GERAD"},{"key":"10.1007\/s13676-017-0112-9_bib21","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s12532-016-0108-8","article-title":"Improved branch-cut-and-price for capacitated vehicle routing","volume":"9","author":"Pecin","year":"2017","journal-title":"Math Progr Comput"},{"key":"10.1007\/s13676-017-0112-9_bib22","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/j.orl.2017.02.006","article-title":"Limited memory rank-1 cuts for vehicle routing problems","volume":"45","author":"Pecin","year":"2017","journal-title":"Oper Res Lett"},{"issue":"43","key":"10.1007\/s13676-017-0112-9_bib23","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/978-0-387-77778-8_18","article-title":"Chv\u00e1tal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows","volume":"20","author":"Petersen","year":"2008","journal-title":"Veh Routing Probl Latest Adv New Chall"},{"issue":"3","key":"10.1007\/s13676-017-0112-9_bib24","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.disopt.2006.05.007","article-title":"Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints","volume":"3","author":"Righini","year":"2006","journal-title":"Discret Optim"},{"key":"10.1007\/s13676-017-0112-9_bib25","series-title":"Vehicle routing: problems, methods, and applications, MOS-SIAM series on optimization","year":"2014"},{"key":"10.1007\/s13676-017-0112-9_bib26","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.cor.2012.07.018","article-title":"A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows","volume":"40","author":"Vidal","year":"2013","journal-title":"Comput Oper Res"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-017-0112-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-017-0112-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300303?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300303?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-017-0112-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:42:03Z","timestamp":1761882123000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620300303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["S2192437620300303"],"URL":"https:\/\/doi.org\/10.1007\/s13676-017-0112-9","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2019,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Selective pricing in branch-price-and-cut algorithms for vehicle routing","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-017-0112-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2017 \u00a9 2017 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}