{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T23:08:08Z","timestamp":1720825688347},"reference-count":60,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["IR\u00a0122\/5-2","IR\u00a0122\/9-2"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1016\/j.ejor.2019.01.041","type":"journal-article","created":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T08:14:15Z","timestamp":1548144855000},"page":"549-565","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies"],"prefix":"10.1016","volume":"276","author":[{"given":"Christian","family":"Tilk","sequence":"first","affiliation":[]},{"given":"Michael","family":"Drexl","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Irnich","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2019.01.041_bib0001","series-title":"Constraint Integer Programming","author":"Achterberg","year":"2007"},{"key":"10.1016\/j.ejor.2019.01.041_bib0002","series-title":"Integrated Location, Routing and Scheduling Problems: Models and Algorithms","author":"Ak\u00e7a","year":"2010"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.041_bib0003","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1287\/trsc.1100.0363","article-title":"Enhanced branch and price and cut for vehicle routing with split deliveries and time windows","volume":"45","author":"Archetti","year":"2011","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2019.01.041_bib0004","series-title":"The vehicle routing problem: Latest advances and new challenges","first-page":"103","article-title":"The split delivery vehicle routing problem: a survey","author":"Archetti","year":"2008"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.041_bib0005","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":"Operations Research"},{"key":"10.1016\/j.ejor.2019.01.041_bib0006","series-title":"Proceedings of the integration of AI and OR techniques in constraint programming. CPAIOR 2017","first-page":"254","article-title":"Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks","author":"Boland","year":"2017"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.041_bib0007","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/j.ipl.2016.01.008","article-title":"Solving the temporal knapsack problem via recursive Dantzig\u2013Wolfe decomposition","volume":"116","author":"Caprara","year":"2016","journal-title":"Information Processing Letters"},{"issue":"0","key":"10.1016\/j.ejor.2019.01.041_bib0008","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1018921527269","article-title":"A method for solving ship routing problems with inventory constraints","volume":"81","author":"Christiansen","year":"1998","journal-title":"Annals of Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.041_bib0009","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1287\/trsc.35.4.375.10432","article-title":"Benders decomposition for simultaneous aircraft routing and crew scheduling","volume":"35","author":"Cordeau","year":"2001","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.041_bib0010","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1287\/opre.1090.0713","article-title":"Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows","volume":"58","author":"Desaulniers","year":"2010","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2019.01.041_bib0011","series-title":"Fleet management and logistics","first-page":"57","article-title":"A unified framework for deterministic time constrained vehicle routing and crew scheduling problems","author":"Desaulniers","year":"1998"},{"key":"10.1016\/j.ejor.2019.01.041_bib0012","series-title":"Column Generation","author":"Desaulniers","year":"2005"},{"issue":"6","key":"10.1016\/j.ejor.2019.01.041_bib0013","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1287\/opre.2016.1535","article-title":"Exact algorithms for electric vehicle-routing problems with time windows","volume":"64","author":"Desaulniers","year":"2016","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2019.01.041_bib0014","series-title":"Proceedings of the vehicle routing: Problems, methods, and applications","first-page":"119","article-title":"The vehicle routing problem with time windows","author":"Desaulniers","year":"2014"},{"key":"10.1016\/j.ejor.2019.01.041_bib0015","series-title":"Network routing","first-page":"35","article-title":"Time constrained routing and scheduling","volume":"8","author":"Desrosiers","year":"1995"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.041_bib0016","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1016\/j.cor.2007.12.011","article-title":"The manpower allocation problem with time windows and job-teaming constraints: a branch-and-price approach","volume":"36","author":"Dohn","year":"2009","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.041_bib0017","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.ejor.2013.03.018","article-title":"Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation","volume":"230","author":"Dohn","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.041_bib0018","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/net.20472","article-title":"The vehicle routing problem with time windows and temporal dependencies","volume":"58","author":"Dohn","year":"2011","journal-title":"Networks"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.041_bib0019","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Mathematical Programming"},{"key":"10.1016\/j.ejor.2019.01.041_bib0020","series-title":"On Some Generalized Routing Problems","author":"Drexl","year":"2007"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.041_bib0021","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","article-title":"Synchronization in vehicle routing-a survey of VRPs with multiple synchronization constraints","volume":"46","author":"Drexl","year":"2012","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.041_bib0022","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/trsc.24.2.145","article-title":"Optimizing the schedule for a fixed vehicle path with convex inconvenience costs","volume":"24","author":"Dumas","year":"1990","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2019.01.041_sbref0023","series-title":"A polyhedral approach to the delivery man problem","author":"van Eijl","year":"1995"},{"issue":"7","key":"10.1016\/j.ejor.2019.01.041_bib0024","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1287\/mnsc.1050.0392","article-title":"Efficient production-distribution system design","volume":"51","author":"Elhedhli","year":"2005","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.041_bib0025","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10288-010-0130-z","article-title":"A tutorial on column generation and branch-and-price for vehicle routing problems","volume":"8","author":"Feillet","year":"2010","journal-title":"4OR"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.041_bib0026","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.1030.0079","article-title":"Traveling salesman problems with profits","volume":"39","author":"Feillet","year":"2005","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.041_bib0027","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"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.041_bib0028","first-page":"239","article-title":"New refinements for the solution of vehicle routing problems with branch and price","volume":"45","author":"Feillet","year":"2007","journal-title":"INFOR"},{"key":"10.1016\/j.ejor.2019.01.041_bib0029","series-title":"Column generation for vehicle routing problems with multiple synchronization constraints","author":"Fink","year":"2016"},{"issue":"1\u20132","key":"10.1016\/j.ejor.2019.01.041_bib0030","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10107-012-0610-3","article-title":"Dynamic graph generation for the shortest path problem in time expanded networks","volume":"143","author":"Fischer","year":"2014","journal-title":"Mathematical Programming"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.041_bib0031","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.47.2.247","article-title":"A column generation approach for large-scale aircrew rostering problems","volume":"47","author":"Gamache","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2019.01.041_bib0032","series-title":"Operations research","article-title":"The vehicle routing problem: Latest advances and new challenges","volume":"43","author":"Golden","year":"2008"},{"key":"10.1016\/j.ejor.2019.01.041_bib0033","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1002\/nav.21489","article-title":"Nested column generation applied to the crude oil tanker routing and scheduling problem with split pickup and split delivery","volume":"59","author":"Hennig","year":"2012","journal-title":"Naval Research Logistics"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.041_bib0034","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0377-2217(98)00343-9","article-title":"Fleet assignment and routing with schedule synchronization constraints","volume":"119","author":"Ioachim","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.041_bib0035","doi-asserted-by":"crossref","unstructured":"Ioachim, I., G\u00e9linas, S., Soumis, F., & Desrosiers, J. (1998). A dynamic programming algorithm for the shortest path problem with time windows and linear node costsNetworks 31, 3,193\u2013204.","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<193::AID-NET6>3.3.CO;2-E"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.041_bib0036","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00291-007-0083-6","article-title":"Resource extension functions: Properties, inversion, and generalization to segments","volume":"30","author":"Irnich","year":"2008","journal-title":"OR Spectrum"},{"key":"10.1016\/j.ejor.2019.01.041_bib0037","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/0-387-25486-2_2","article-title":"Shortest path problems with resource constraints","author":"Irnich","year":"2005","journal-title":"Column Generation"},{"key":"10.1016\/j.ejor.2019.01.041_bib0038","series-title":"Proceedings of the Vehicle routing: Problems, methods, and applications","first-page":"241","article-title":"Four variants of the vehicle routing problem","author":"Irnich","year":"2014"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.041_bib0039","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.ejor.2009.11.014","article-title":"Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems","volume":"204","author":"Jans","year":"2010","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.041_bib0040","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/j.disopt.2014.08.001","article-title":"A branch-and-cut algorithm for the capacitated profitable tour problem","volume":"14","author":"Jepsen","year":"2014","journal-title":"Discrete Optimization"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.041_bib0041","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":"256","author":"Jepsen","year":"2008","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.041_bib0042","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.trb.2008.08.002","article-title":"A nested decomposition approach for solving the paratransit vehicle scheduling problem","volume":"43","author":"Karabuk","year":"2009","journal-title":"Transportation Research Part B"},{"key":"10.1016\/j.ejor.2019.01.041_bib0043","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/trsc.33.1.101","article-title":"2-path cuts for the vehicle routing problem with time windows","volume":"33","author":"Kohl","year":"1999","journal-title":"Transportation Science"},{"key":"10.1016\/j.ejor.2019.01.041_bib0044","doi-asserted-by":"crossref","unstructured":"Liberatore, F., Righini, G., & Salani, M. (2011). A column generation algorithm for the vehicle routing problem with soft time windows. 4OR 9, 1, 49\u201382.","DOI":"10.1007\/s10288-010-0136-6"},{"issue":"6","key":"10.1016\/j.ejor.2019.01.041_bib0045","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":"Operations Research"},{"issue":"0","key":"10.1016\/j.ejor.2019.01.041_bib0046","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1023\/A:1018989130169","article-title":"A mixed-integer model for solving ordering problems with side constraints","volume":"69","author":"Maffioli","year":"1997","journal-title":"Annals of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.041_bib0047","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s10729-013-9243-1","article-title":"The home health care routing and scheduling problem with interdependent services","volume":"17","author":"Mankowska","year":"2014","journal-title":"Health Care Management Science"},{"issue":"3","key":"10.1016\/j.ejor.2019.01.041_bib0048","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1287\/trsc.2013.0489","article-title":"A branch-and-price algorithm for the multidepot vehicle routing problem with interdepot routes","volume":"48","author":"Muter","year":"2014","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.041_bib0049","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":"Mathematical Programming Computation"},{"key":"10.1016\/j.ejor.2019.01.041_bib0050","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":"Discrete Optimization"},{"issue":"5","key":"10.1016\/j.ejor.2019.01.041_sbref0049","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/trsc.2017.0765","article-title":"Branch-and-price-and-cut for the truck-and-trailer routing problem with time windows","volume":"52","author":"Rothenb\u00e4cher","year":"2018","journal-title":"Transportation Science"},{"issue":"13","key":"10.1016\/j.ejor.2019.01.041_bib0052","doi-asserted-by":"crossref","first-page":"3625","DOI":"10.1080\/00207540801968625","article-title":"A nested column generation algorithm to the meta slab allocation problem in the steel making industry","volume":"47","author":"Song","year":"2009","journal-title":"International Journal of Production Research"},{"issue":"4","key":"10.1016\/j.ejor.2019.01.041_bib0053","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1287\/trsc.2013.0510","article-title":"The time window assignment vehicle routing problem","volume":"49","author":"Spliet","year":"2014","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2019.01.041_bib0054","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ejor.2006.06.028","article-title":"Arc routing problems with time-dependent service costs","volume":"181","author":"Tagmouti","year":"2007","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.041_bib0055","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1287\/trsc.2016.0730","article-title":"Branch-and-price-and-cut for the active-passive vehicle-routing problem","volume":"52","author":"Tilk","year":"2018","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2019.01.041_bib0056","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.ejor.2017.03.017","article-title":"Asymmetry matters: Dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster","volume":"261","author":"Tilk","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2019.01.041_bib0057","series-title":"Vehicle routing: Problems, methods, and applications","author":"Toth","year":"2014"},{"key":"10.1016\/j.ejor.2019.01.041_bib0058","series-title":"Acceleration and Stabilization Techniques for Column Generation Applied to Capacitated Resource Management Problems","author":"Uygur","year":"2011"},{"issue":"6","key":"10.1016\/j.ejor.2019.01.041_bib0059","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1287\/mnsc.47.6.864.9809","article-title":"A nested decomposition approach to a three-stage, two-dimensional cutting stock problem","volume":"47","author":"Vanderbeck","year":"2001","journal-title":"Management Science"},{"key":"10.1016\/j.ejor.2019.01.041_bib0060","unstructured":"Visser, T. (2015). Synchronization in simultaneous vehicle and crew routing and scheduling problems with breaks. Master\u2019s thesis, Utrecht University Utrecht, The Netherlands."}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300761?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221719300761?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T22:58:16Z","timestamp":1573772296000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221719300761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":60,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S0377221719300761"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.041","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2019.01.041","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}