{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:03:10Z","timestamp":1774447390756,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003141","name":"SECIHTI","doi-asserted-by":"publisher","award":["CBF-2025-I-2005"],"award-info":[{"award-number":["CBF-2025-I-2005"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Expert Systems with Applications"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.eswa.2025.131007","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T12:55:07Z","timestamp":1767617707000},"page":"131007","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Branch and cut for the team orienteering problem with nonidentical agents and balanced score"],"prefix":"10.1016","volume":"307","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1156-6803","authenticated-orcid":false,"given":"Vincent","family":"Boyer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9986-3911","authenticated-orcid":false,"given":"Gabriela","family":"S\u00e1nchez-Yepez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5272-4105","authenticated-orcid":false,"given":"M.","family":"Ang\u00e9lica Salazar-Aguilar","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.eswa.2025.131007_bib0001","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1016\/j.ejor.2023.09.038","article-title":"A new formulation and a branch-and-cut algorithm for the set orienteering problem","volume":"314","author":"Archetti","year":"2024","journal-title":"European Journal of Operational research"},{"issue":"2","key":"10.1016\/j.eswa.2025.131007_bib0002","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/j.ejor.2018.08.034","article-title":"Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm","volume":"273","author":"Bekta\u015f","year":"2019","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2025.131007_bib0003","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2023.106488","article-title":"A cooperative team orienteering optimisation model and a customised resolution metaheuristic","volume":"163","author":"Bendazzoli","year":"2024","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.eswa.2025.131007_bib0004","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1111\/itor.12422","article-title":"A branch-and-cut algorithm for the team orienteering problem","volume":"25","author":"Bianchessi","year":"2018","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.eswa.2025.131007_bib0005","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/0377-2217(94)00289-4","article-title":"The team orienteering problem","volume":"88","author":"Chao","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.eswa.2025.131007_bib0006","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/trsc.2018.0878","article-title":"Exact branch-price-and-cut algorithms for vehicle routing","volume":"53","author":"Costa","year":"2019","journal-title":"Transportation Science"},{"issue":"2","key":"10.1016\/j.eswa.2025.131007_bib0007","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":"4","key":"10.1016\/j.eswa.2025.131007_bib0008","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<263::AID-NET3>3.0.CO;2-Q","article-title":"A branch-and-cut algorithm for the undirected selective traveling salesman problem","volume":"32","author":"Gendreau","year":"1998","journal-title":"Networks (N. Y.)"},{"issue":"2","key":"10.1016\/j.eswa.2025.131007_bib0009","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"},{"key":"10.1016\/j.eswa.2025.131007_bib0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.123561","article-title":"An efficient hybrid adaptive large neighborhood search method for the capacitated team orienteering problem","volume":"249","author":"Hammami","year":"2024","journal-title":"Expert Systems with Applications"},{"key":"10.1016\/j.eswa.2025.131007_bib0011","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejor.2024.06.025","article-title":"An exact algorithm for the multi-trip vehicle routing problem with time windows and multi-skilled manpower","author":"Huang","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2025.131007_bib0012","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2024.110097","article-title":"Team orienteering with possible multiple visits: mathematical model and solution algorithms","volume":"190","author":"Jung","year":"2024","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"10.1016\/j.eswa.2025.131007_bib0013","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2025.01.009","article-title":"The dynamic team orienteering problem","volume":"324","author":"Kirac","year":"2025","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/j.eswa.2025.131007_bib0014","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ejor.2023.07.034","article-title":"A revisited branch-and-cut algorithm for large-scale orienteering problems","volume":"313","author":"Kobeaga","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.eswa.2025.131007_bib0015","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/j.ejor.2024.07.015","article-title":"Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits","volume":"319","author":"Li","year":"2024","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.eswa.2025.131007_bib0016","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2025.127369","article-title":"Exact and heuristic algorithms for team orienteering problem with fuzzy travel times","volume":"278","author":"Liu","year":"2025","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"10.1016\/j.eswa.2025.131007_bib0017","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/trsc.2023.0003","article-title":"The orienteering problem with drones","volume":"58","author":"Morandi","year":"2024","journal-title":"Transportation Science"},{"issue":"6","key":"10.1016\/j.eswa.2025.131007_bib0018","doi-asserted-by":"crossref","first-page":"1673","DOI":"10.1287\/trsc.2019.0900","article-title":"Comparative analysis of capacitated arc routing formulations for designing a new branch-cut-and-price algorithm","volume":"53","author":"Pecin","year":"2019","journal-title":"Transportation Science"},{"issue":"23","key":"10.1016\/j.eswa.2025.131007_bib0019","doi-asserted-by":"crossref","first-page":"7957","DOI":"10.1080\/00207543.2022.2162146","article-title":"Team orienteering problem with nonidentical agents and balanced score","volume":"61","author":"S\u00e1nchez-Yepez","year":"2023","journal-title":"International Journal of Production Research"},{"issue":"9","key":"10.1016\/j.eswa.2025.131007_bib0020","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1057\/jors.1984.162","article-title":"Heuristic methods applied to orienteering","volume":"35","author":"Tsiligirides","year":"1984","journal-title":"The Journal of the Operational Research Society"},{"issue":"1","key":"10.1016\/j.eswa.2025.131007_bib0021","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.eswa.2025.131007_bib0022","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121996","article-title":"Simulated annealing with reinforcement learning for the set team orienteering problem with time windows","volume":"238","author":"Yu","year":"2024","journal-title":"Expert Systems with Applications"}],"container-title":["Expert Systems with Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417425046226?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0957417425046226?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T12:21:37Z","timestamp":1774441297000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0957417425046226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":22,"alternative-id":["S0957417425046226"],"URL":"https:\/\/doi.org\/10.1016\/j.eswa.2025.131007","relation":{},"ISSN":["0957-4174"],"issn-type":[{"value":"0957-4174","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Branch and cut for the team orienteering problem with nonidentical agents and balanced score","name":"articletitle","label":"Article Title"},{"value":"Expert Systems with Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.eswa.2025.131007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"131007"}}