{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T13:44:53Z","timestamp":1769089493151,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642321467","type":"print"},{"value":"9783642321474","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32147-4_23","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T11:54:50Z","timestamp":1341489290000},"page":"249-260","source":"Crossref","is-referenced-by-count":15,"title":["Layered Formulation for the Robust Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Agostinho","family":"Agra","sequence":"first","affiliation":[]},{"given":"Marielle","family":"Christiansen","sequence":"additional","affiliation":[]},{"given":"Rosa","family":"Figueiredo","sequence":"additional","affiliation":[]},{"given":"Lars","family":"Magnus Hvattum","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Poss","sequence":"additional","affiliation":[]},{"given":"Cristina","family":"Requejo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"23_CR1","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1002\/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q","volume":"36","author":"N. Ascheuer","year":"2000","unstructured":"Ascheuer, N., Fischetti, M., Gr\u00f6tschel, M.: A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks\u00a036(2), 69\u201379 (2000)","journal-title":"Networks"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1287\/trsc.36.2.250.565","volume":"36","author":"J.F. Bard","year":"2002","unstructured":"Bard, J.F., Kontoravdis, G., Yu, G.: A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science\u00a036, 250\u2013269 (2002)","journal-title":"Transportation Science"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Ghaoui, L.E., Nemirovski, A.: Robust optimization. Princeton University Press (2009)","DOI":"10.1515\/9781400831050"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A. Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Operations Research Letters\u00a025, 1\u201313 (1999)","journal-title":"Operations Research Letters"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D. Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Review\u00a053, 464\u2013501 (2011)","journal-title":"SIAM Review"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D. Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Operations Research\u00a052, 35\u201353 (2004)","journal-title":"Operations Research"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1016\/j.tre.2011.12.001","volume":"48","author":"M. Chardy","year":"2012","unstructured":"Chardy, M., Klopfenstein, O.: Handling uncertainties in vehicle routing problems through data preprocessing. Transportation Research Part E: Logistics and Transportation Review\u00a048(3), 667\u2013683 (2012)","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Christiansen, M., Fagerholt, K., Nygreen, B., Ronen, D.: Maritime Transportation. In: Handbooks in Operations Research and Management Science, vol.\u00a014, pp. 150\u2013168. Elsevier Science Publishers, North-Holland (2007)","DOI":"10.1016\/S0927-0507(06)14004-9"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Desrosiers, J., Spoorendonk, S.: The Vehicle Routing Problem with Time Windows: State-of-the-Art Exact Solution Methods. John Wiley & Sons, Inc. (2010)","DOI":"10.1002\/9780470400531.eorms1034"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/j.disopt.2007.05.001","volume":"5","author":"M.T. Godinho","year":"2008","unstructured":"Godinho, M.T., Gouveia, L., Magnanti, T.L.: Combined route capacity and route length models for unit demand vehicle routing problems. Discrete Optimization\u00a05(2), 350\u2013372 (2008)","journal-title":"Discrete Optimization"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Golden, B., Raghavan, S., Wasil, E.A.: The vehicle routing problem: latest advances and new challenges. Operations Research\/Computer Science Interfaces Series, vol.\u00a043. Springer (2008)","DOI":"10.1007\/978-0-387-77778-8"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/ijoc.10.2.180","volume":"10","author":"L. Gouveia","year":"1998","unstructured":"Gouveia, L.: Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints. INFORMS J. on Computing\u00a010, 180\u2013188 (1998)","journal-title":"INFORMS J. on Computing"},{"issue":"7","key":"23_CR13","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1016\/j.cor.2006.11.006","volume":"35","author":"B. Kallehauge","year":"2008","unstructured":"Kallehauge, B.: Formulations and exact algorithms for the vehicle routing problem with time windows. Computers & OR\u00a035(7), 2307\u20132330 (2008)","journal-title":"Computers & OR"},{"issue":"4","key":"23_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1002\/net.20178","volume":"49","author":"B. Kallehauge","year":"2007","unstructured":"Kallehauge, B., Boland, N., Madsen, O.B.G.: Path inequalities for the vehicle routing problem with time windows. Networks\u00a049(4), 273\u2013293 (2007)","journal-title":"Networks"},{"key":"23_CR15","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B.G., Solomon, M.M.: Vehicle routing problem with time window. In: Column Generation. Springer (2005)"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"C.E. Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM\u00a07, 326\u2013329 (1960)","journal-title":"J. ACM"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Ord\u00f3nez, F.: Robust vehicle routing. TUTORIALS in Oprations Research, 153\u2013178 (2010)","DOI":"10.1287\/educ.1100.0078"},{"key":"23_CR18","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1057\/palgrave.jors.2602465","volume":"59","author":"R. Russell","year":"2008","unstructured":"Russell, R., Urban, T.: Vehicle routing with soft time windows and erlang travel times. Journal of the Operational Research Society\u00a059, 1220\u20131228 (2008)","journal-title":"Journal of the Operational Research Society"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"A.L. Soyster","year":"1973","unstructured":"Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Operations Research\u00a021, 1154\u20131157 (1973)","journal-title":"Operations Research"},{"key":"23_CR20","unstructured":"Suite, F.X.O.: Xpress-Optimizer reference manual. Tech. Rep. Release 22.01 (2011)"},{"issue":"5","key":"23_CR21","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1080\/07408170701745378","volume":"40","author":"I. Sungur","year":"2008","unstructured":"Sungur, I., Ord\u00f3\u00f1ez, F., Dessouky, M.: A robust optimization approach for the capacitated vehicle routing. IIE Transactions\u00a040(5), 509\u2013523 (2008)","journal-title":"IIE Transactions"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32147-4_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:56:04Z","timestamp":1620129364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}