{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:02:18Z","timestamp":1775818938113,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,3,19]],"date-time":"2016-03-19T00:00:00Z","timestamp":1458345600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10601-016-9241-2","type":"journal-article","created":{"date-parts":[[2016,3,19]],"date-time":"2016-03-19T07:26:06Z","timestamp":1458372366000},"page":"394-412","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["A branch-and-price-and-check model for the vehicle routing problem with location congestion"],"prefix":"10.1007","volume":"21","author":[{"given":"Edward","family":"Lam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal Van","family":"Hentenryck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,19]]},"reference":[{"issue":"2","key":"9241_CR1","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/trsc.36.2.250.565","volume":"36","author":"JF Bard","year":"2002","unstructured":"Bard, J.F., Kontoravdis, G., & Yu, G. (2002). A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science, 36(2), 250\u2013269.","journal-title":"Transportation Science"},{"key":"9241_CR2","doi-asserted-by":"crossref","unstructured":"Beck, J. (2010). Checking-up on branch-and-check. In Cohen, D. (Ed.), Principles and practice of constraint programming \u2013 cp 2010, lecture notes in computer science (Vol. 6308, pp. 84\u201398). Berlin Heidelberg: Springer.","DOI":"10.1007\/978-3-642-15396-9_10"},{"key":"9241_CR3","doi-asserted-by":"crossref","unstructured":"Beck, J., Prosser, P., & Selensky, E. (2002). On the reformulation of vehicle routing problems and scheduling problems. In Koenig, S., Holte, R. (Eds.), Abstraction, reformulation, and approximation, lecture notes in computer science (Vol. 2371, pp. 282\u2013289). Berlin Heidelberg: Springer.","DOI":"10.1007\/3-540-45622-8_21"},{"key":"9241_CR4","unstructured":"Beck, J.C., Prosser, P., & Selensky, E. (2003). Vehicle routing and job shop scheduling: What\u2019s the difference? In ICAPS (pp. 267\u2013276)."},{"issue":"4","key":"9241_CR5","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/trsc.1030.0049","volume":"38","author":"R Bent","year":"2004","unstructured":"Bent, R., & Van Hentenryck, P. (2004). A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science, 38(4), 515\u2013530.","journal-title":"Transportation Science"},{"key":"9241_CR6","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Desrosiers, J., & Solomon, M. (2002). Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. In Essays and surveys in metaheuristics, operations research\/computer science interfaces series (Vol. 15, pp. 309\u2013324). US: Springer.","DOI":"10.1007\/978-1-4615-1507-4_14"},{"key":"9241_CR7","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Desrosiers, J., & Solomon, M.M. (2005). Column generation (Vol. 5). Springer.","DOI":"10.1007\/b135457"},{"issue":"3","key":"9241_CR8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1287\/trsc.1110.0400","volume":"46","author":"M Drexl","year":"2012","unstructured":"Drexl, M. (2012). Synchronization in vehicle routing\u2014a survey of VRPs with multiple synchronization constraints. Transportation Science, 46(3), 297\u2013316.","journal-title":"Transportation Science"},{"issue":"1","key":"9241_CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y Dumas","year":"1991","unstructured":"Dumas, Y., Desrosiers, J., & Soumis, F. (1991). The pickup and delivery problem with time windows. European Journal of Operational Research, 54(1), 7\u201322.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"9241_CR10","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1016\/j.cor.2011.02.002","volume":"40","author":"NE Hachemi","year":"2013","unstructured":"Hachemi, N.E., Gendreau, M., & Rousseau, L.M. (2013). A heuristic to solve the synchronized log-truck scheduling problem. Computers & Operations Research, 40 (3), 666\u2013673. Transport Scheduling.","journal-title":"Computers & Operations Research"},{"key":"9241_CR11","doi-asserted-by":"crossref","unstructured":"Hempsch, C., & Irnich, S. (2008). Vehicle routing problems with inter-tour resource constraints. In Golden, B., Raghavan, S., Wasil E. (Eds.), The vehicle routing problem: latest advances and new challenges, operations research\/computer science interfaces (Vol. 43, pp. 421\u2013444). US: Springer.","DOI":"10.1007\/978-0-387-77778-8_19"},{"key":"9241_CR12","doi-asserted-by":"crossref","unstructured":"Hooker, J. (1994). Logic-based methods for optimization. In Borning, A. (Ed.) Principles and practice of constraint programming, lecture notes in computer science (Vol. 874, pp. 336\u2013349). Berlin Heidelberg: Springer.","DOI":"10.1007\/3-540-58601-6_111"},{"issue":"1","key":"9241_CR13","first-page":"183","volume":"50","author":"JN Hooker","year":"2008","unstructured":"Hooker, J.N., & Mitchell, J.E. (2008). Integrated methods for optimization. SIAM review, 50(1), 183.","journal-title":"SIAM review"},{"key":"9241_CR14","doi-asserted-by":"crossref","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B., & Solomon, M.M. (2005). Vehicle routing problem with time windows. In Desaulniers, G., Desrosiers, J., Solomon, M.M. (Eds.), Column generation (pp. 67\u201398). US: Springer.","DOI":"10.1007\/0-387-25486-2_3"},{"issue":"6","key":"9241_CR15","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"ME L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke, M.E., & Desrosiers, J. (2005). Selected topics in column generation. Operations Research, 53(6), 1007\u20131023.","journal-title":"Operations Research"},{"issue":"2","key":"9241_CR16","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1057\/jors.2013.170","volume":"66","author":"G Rix","year":"2015","unstructured":"Rix, G., Rousseau, L.M., & Pesant, G. (2015). A column generation algorithm for tactical timber transportation planning. Journal of the Operational Research Society, 66(2), 278\u2013287.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"9241_CR17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S Ropke","year":"2009","unstructured":"Ropke, S., & Cordeau, J.F. (2009). Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science, 43(3), 267\u2013286.","journal-title":"Transportation Science"},{"issue":"4","key":"9241_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. (2007). Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks, 49(4), 258\u2013272.","journal-title":"Networks"},{"key":"9241_CR19","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In Maher, M., Puget, J.F. (Eds.), Principles and practice of constraint programming \u2014 cp98, lecture notes in computer science (Vol. 1520, pp. 417\u2013431), Berlin Heidelberg: Springer.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"9241_CR20","doi-asserted-by":"crossref","unstructured":"Thorsteinsson, E. (2001). Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. In Walsh, T. (Ed.), Principles and practice of constraint programming \u2014 cp 2001, lecture notes in computer science (Vol. 2239, pp. 16\u201330). Berlin Heidelberg: Springer.","DOI":"10.1007\/3-540-45578-7_2"},{"key":"9241_CR21","doi-asserted-by":"crossref","unstructured":"Toth, P., & Vigo, D. (2002). The vehicle routing problem. Society for industrial and applied mathematics. Philadelphia.","DOI":"10.1137\/1.9780898718515"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9241-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-016-9241-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-016-9241-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:14:19Z","timestamp":1559243659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-016-9241-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,19]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9241"],"URL":"https:\/\/doi.org\/10.1007\/s10601-016-9241-2","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,19]]}}}