{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T00:12:03Z","timestamp":1778199123474,"version":"3.51.4"},"reference-count":28,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T00:00:00Z","timestamp":1776988800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.ejor.2026.04.026","type":"journal-article","created":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T15:11:30Z","timestamp":1777043490000},"page":"40-50","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["A generalized set partitioning model for MinMax vehicle routing"],"prefix":"10.1016","volume":"334","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7835-136X","authenticated-orcid":false,"given":"Jens","family":"Lysgaard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8989-6015","authenticated-orcid":false,"given":"Sune Lauth","family":"Gadegaard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2026.04.026_b1","series-title":"Concorde","author":"Applegate","year":"2015"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.026_b2","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1287\/ijoc.14.2.132.118","article-title":"Solution of a min-max vehicle routing problem","volume":"14","author":"Applegate","year":"2002","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.026_b3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jalgor.2005.01.007","article-title":"Approximations for minimum and min-max vehicle routing problems","volume":"59","author":"Arkin","year":"2006","journal-title":"Journal of Algorithms"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.026_b4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/trsc.1070.0209","article-title":"Routing for relief efforts","volume":"42","author":"Campbell","year":"2008","journal-title":"Transportation Science"},{"issue":"4","key":"10.1016\/j.ejor.2026.04.026_b5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1057\/palgrave.jors.2601324","article-title":"Heuristic solutions to the problem of routing school buses with multiple objectives","volume":"53","author":"Corber\u00e1n","year":"2002","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"10.1016\/j.ejor.2026.04.026_b6","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1287\/opre.2.4.393","article-title":"Solution of a large-scale traveling-salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Journal of the Operations Research Society of America"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.026_b7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Management Science"},{"key":"10.1016\/j.ejor.2026.04.026_b8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-3-642-56423-9_17","article-title":"MinMax vehicle routing problems: Application to school transport in the province of Burgos","volume":"505","author":"Delgado","year":"2001","journal-title":"Lecture Notes in Economics and Mathematical Systems"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.026_b9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0167-6377(91)90083-2","article-title":"Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints","volume":"10","author":"Desrochers","year":"1991","journal-title":"Operations Research Letters"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.026_b10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.10.2.133","article-title":"Solving the orienteering problem through branch-and-cut","volume":"10","author":"Fischetti","year":"1998","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.026_b11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.29.3.267","article-title":"The m-traveling salesman problem with minmax objective","volume":"29","author":"Fran\u00e7a","year":"1995","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.026_b12","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1137\/0207017","article-title":"Approximation algorithms for some routing problems","volume":"7","author":"Frederickson","year":"1978","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.026_b13","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1287\/opre.28.3.694","article-title":"Approximate traveling salesman algorithms","volume":"28","author":"Golden","year":"1980","journal-title":"Operations Research"},{"issue":"5","key":"10.1016\/j.ejor.2026.04.026_b14","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0305-0548(96)00065-2","article-title":"An adaptive memory heuristic for a class of vehicle routing problems with minmax objective","volume":"24","author":"Golden","year":"1997","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.026_b15","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2016.04.059","article-title":"Orienteering Problem: A survey of recent variants, solution approaches and applications","volume":"255","author":"Gunawan","year":"2016","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.04.026_b16","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","article-title":"Multi-objective vehicle routing problems","volume":"189","author":"Jozefowiez","year":"2008","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"10.1016\/j.ejor.2026.04.026_b17","doi-asserted-by":"crossref","first-page":"2320","DOI":"10.1016\/j.cor.2008.09.008","article-title":"Exploiting sparsity in pricing routines for the capacitated arc routing problem","volume":"36","author":"Letchford","year":"2009","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.026_b18","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.ejor.2014.04.008","article-title":"A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem","volume":"238","author":"L\u00f3pez-S\u00e1nchez","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.026_b19","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1111\/itor.12581","article-title":"A matheuristic for the MinMax capacitated open vehicle routing problem","volume":"27","author":"Lysgaard","year":"2020","journal-title":"International Transactions in Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2026.04.026_b20","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","article-title":"Integer programming formulation of traveling salesman problems","volume":"7","author":"Miller","year":"1960","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"10.1016\/j.ejor.2026.04.026_b21","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1287\/trsc.1120.0437","article-title":"Bi-objective bus routing: An application to school buses in rural areas","volume":"47","author":"Pacheco","year":"2013","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.026_b22","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1057\/palgrave.jors.2601917","article-title":"Tabu search for a multi-objective routing problem","volume":"57","author":"Pacheco","year":"2006","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.026_b23","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10100-016-0437-8","article-title":"Generating subtour elimination constraints for the TSP from pure integer solutions","volume":"25","author":"Pferschy","year":"2017","journal-title":"CEJOR"},{"key":"10.1016\/j.ejor.2026.04.026_b24","series-title":"Computer scheduling of public transport: Urban passenger vehicle and crew scheduling","first-page":"269","article-title":"An integer programming approach to scheduling","author":"Ryan","year":"1981"},{"issue":"5","key":"10.1016\/j.ejor.2026.04.026_b25","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1057\/palgrave.jors.2600924","article-title":"A heuristic method for the open vehicle routing problem","volume":"51","author":"Sariklis","year":"2000","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.ejor.2026.04.026_b26","series-title":"Integer programming and combinatorial optimization","first-page":"433","article-title":"A new branching rule for range minimization problems","volume":"vol. 14679","author":"van Rossum","year":"2024"},{"issue":"1","key":"10.1016\/j.ejor.2026.04.026_b27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","article-title":"The orienteering problem: A survey","volume":"209","author":"Vansteenwegen","year":"2011","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.04.026_b28","author":"WHIZZKIDS \u201996","year":"1996"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726003760?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726003760?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T23:57:05Z","timestamp":1778198225000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726003760"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0377221726003760"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.04.026","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A generalized set partitioning model for MinMax vehicle routing","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2026.04.026","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}