{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T14:02:45Z","timestamp":1777903365340,"version":"3.51.4"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T00:00:00Z","timestamp":1604102400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T00:00:00Z","timestamp":1604102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["201604490024"],"award-info":[{"award-number":["201604490024"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ELSAT 2020"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10288-020-00461-y","type":"journal-article","created":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T19:02:42Z","timestamp":1604170962000},"page":"571-592","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Mixed integer programming formulations for the generalized traveling salesman problem with time windows"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5072-2672","authenticated-orcid":false,"given":"Yuan","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Diego","family":"Cattaruzza","sequence":"additional","affiliation":[]},{"given":"Maxime","family":"Ogier","sequence":"additional","affiliation":[]},{"given":"Cyriaque","family":"Rousselot","sequence":"additional","affiliation":[]},{"given":"Fr\u00e9d\u00e9ric","family":"Semet","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,31]]},"reference":[{"issue":"3","key":"461_CR1","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/PL00011432","volume":"90","author":"N Ascheuer","year":"2001","unstructured":"Ascheuer N, Fischetti M, Gr\u00f6tschel M (2001) Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math Program 90(3):475\u2013506","journal-title":"Math Program"},{"issue":"3","key":"461_CR2","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1287\/ijoc.1110.0456","volume":"24","author":"R Baldacci","year":"2012","unstructured":"Baldacci R, Mingozzi A, Roberti R (2012) New state-space relaxations for solving the traveling salesman problem with time windows. INFORMS J Comput 24(3):356\u2013371","journal-title":"INFORMS J Comput"},{"issue":"1","key":"461_CR3","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1287\/ijoc.1100.0432","volume":"24","author":"S Dash","year":"2012","unstructured":"Dash S, G\u00fcnl\u00fck O, Lodi A, Tramontani A (2012) A time bucket formulation for the traveling salesman problem with time windows. INFORMS J Comput 24(1):132\u2013147","journal-title":"INFORMS J Comput"},{"issue":"2","key":"461_CR4","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40(2):342\u2013354","journal-title":"Oper Res"},{"issue":"3","key":"461_CR5","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M Fischetti","year":"1997","unstructured":"Fischetti M, Salazar Gonz\u00e1lez JJ, Toth P (1997) A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Oper Res 45(3):378\u2013394","journal-title":"Oper Res"},{"key":"461_CR6","unstructured":"Hawkins AJ (2018) Amazon will now deliver packages to the trunk of your car. https:\/\/www.theverge.com\/2018\/4\/24\/17261744\/amazon-package-delivery-car-trunk-gm-volvo. Accessed May 2019"},{"issue":"2","key":"461_CR7","first-page":"97","volume":"40","author":"E Israeli","year":"2002","unstructured":"Israeli E, Wood RK (2002) Shortest-path network interdiction. Netw Int J 40(2):97\u2013111","journal-title":"Netw Int J"},{"key":"461_CR8","unstructured":"Kara I, Guden H, Koc ON (2012) New formulations for the generalized traveling salesman problem. In: Proceedings of the 6th international conference on applied mathematics, simulation, modelling, ASM, vol\u00a012, pp 60\u201365"},{"key":"461_CR9","unstructured":"Karapetyan D (2012) Gtsp instances library. http:\/\/www.cs.nott.ac.uk\/~pszdk\/gtsp.html. Accessed Aug 2018"},{"key":"461_CR10","unstructured":"Kirsten K (2016) Volvo\u2019s solution for the package theft epidemic: your car\u2019s trunk. http:\/\/fortune.com\/2016\/05\/10\/volvo-urb-it-delivery\/. Accessed Mar 2019"},{"issue":"4","key":"461_CR11","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326\u2013329","journal-title":"J ACM"},{"key":"461_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.trb.2017.02.003","volume":"100","author":"G Ozbaygin","year":"2017","unstructured":"Ozbaygin G, Karasan OE, Savelsbergh M, Yaman H (2017) A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations. Transp Res Part B Methodol 100:115\u2013137","journal-title":"Transp Res Part B Methodol"},{"issue":"11","key":"461_CR13","doi-asserted-by":"publisher","first-page":"932","DOI":"10.3844\/ajassp.2007.932.937","volume":"4","author":"PC Pop","year":"2007","unstructured":"Pop PC (2007) New integer programming formulations of the generalized traveling salesman problem. Am J Appl Sci 4(11):932\u2013937","journal-title":"Am J Appl Sci"},{"key":"461_CR14","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.trc.2017.04.003","volume":"80","author":"D Reyes","year":"2017","unstructured":"Reyes D, Savelsbergh M, Toriello A (2017) Vehicle routing with roaming delivery locations. Transp Res Part C Emerg Technol 80:71\u201391","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"3","key":"461_CR15","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.ejor.2020.04.024","volume":"286","author":"Y Yuan","year":"2020","unstructured":"Yuan Y, Cattaruzza D, Ogier M, Semet F (2020a) A branch-and-cut algorithm for the generalized traveling salesman problem with time windows. Eur J Oper Res 286(3):849\u2013866","journal-title":"Eur J Oper Res"},{"issue":"2","key":"461_CR16","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.orl.2020.01.008","volume":"48","author":"Y Yuan","year":"2020","unstructured":"Yuan Y, Cattaruzza D, Ogier M, Semet F (2020b) A note on the lifted Miller\u2013Tucker\u2013Zemlin subtour elimination constraints for routing problems with time windows. Oper Res Lett 48(2):167\u2013169","journal-title":"Oper Res Lett"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00461-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-020-00461-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-020-00461-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T10:11:39Z","timestamp":1637575899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-020-00461-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,31]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["461"],"URL":"https:\/\/doi.org\/10.1007\/s10288-020-00461-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,31]]},"assertion":[{"value":"8 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"This manuscript has not been published and is not under consideration for publication elsewhere. We have no conflicts of interest to disclose. All authors have approved the manuscript and agree with its submission to \u201c4OR-A Quarterly Journal of Operations Research\u201d.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}