{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:53:33Z","timestamp":1774994013355,"version":"3.50.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Foundation for Science and Technology","doi-asserted-by":"publisher","award":["UID\/06522\/2025"],"award-info":[{"award-number":["UID\/06522\/2025"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Foundation for Science and Technology","doi-asserted-by":"publisher","award":["UID\/97\/2025"],"award-info":[{"award-number":["UID\/97\/2025"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ejor.2026.01.018","type":"journal-article","created":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T08:27:49Z","timestamp":1769070469000},"page":"748-763","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-index formulations for the traveling purchaser problem with incompatibility constraints"],"prefix":"10.1016","volume":"332","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3289-2587","authenticated-orcid":false,"given":"Raquel","family":"Bernardino","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0611-2460","authenticated-orcid":false,"given":"Daniel","family":"Santos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.ejor.2026.01.018_bib0001","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1111\/itor.12330","article-title":"Metaheuristics based on decision hierarchies for the traveling purchaser problem","volume":"25","author":"Bernardino","year":"2018","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.018_bib0002","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1002\/net.22036","article-title":"The family traveling salesman problem with incompatibility constraints","volume":"79","author":"Bernardino","year":"2022","journal-title":"Networks"},{"key":"10.1016\/j.ejor.2026.01.018_bib0003","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.dam.2020.08.014","article-title":"A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand","volume":"288","author":"Bianchessi","year":"2021","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"10.1016\/j.ejor.2026.01.018_bib0004","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1016\/j.ejor.2022.06.045","article-title":"Regulating the rebound effect in the traveling purchaser problem","volume":"317","author":"Caballero","year":"2024","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.018_bib0005","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1016\/j.ejor.2017.02.002","article-title":"The directed profitable rural postman problem with incompatibility constraints","volume":"261","author":"Colombi","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.018_bib0006","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1111\/itor.12985","article-title":"A GRASP\/path-relinking algorithm for the traveling purchaser problem","volume":"30","author":"Cuellar-Usaqu\u00e9n","year":"2023","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/j.ejor.2026.01.018_bib0007","first-page":"1","article-title":"Red deer algorithm (RDA): A new nature-inspired meta-heuristic","author":"Fathollahi-Fard","year":"2020","journal-title":"Soft Computing"},{"key":"10.1016\/j.ejor.2026.01.018_bib0008","article-title":"The travelling salesman problem and related problems","author":"Gavish","year":"1978","journal-title":"Working Paper, Graduate School of Management, University of Rochester"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.018_bib0009","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ejor.2015.06.073","article-title":"The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach","volume":"248","author":"Gendreau","year":"2016","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.018_bib0010","series-title":"Graphs and algorithms","author":"Gondran","year":"1984"},{"key":"10.1016\/j.ejor.2026.01.018_bib0011","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejor.2025.02.024","article-title":"An iterated local search algorithm for the traveling purchaser problem","author":"Kapancioglu","year":"2025","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2026.01.018_bib0012","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2022.105700","article-title":"The traveling purchaser problem with fast service option","volume":"141","author":"Kucukoglu","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.018_bib0013","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/net.21588","article-title":"A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints","volume":"65","author":"Manerba","year":"2015","journal-title":"Networks"},{"issue":"1","key":"10.1016\/j.ejor.2026.01.018_bib0014","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2016.12.017","article-title":"The traveling purchaser problem and its variants","volume":"259","author":"Manerba","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2026.01.018_bib0015","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.ejor.2018.08.039","article-title":"The bi-objective traveling purchaser problem with deliveries","volume":"273","author":"Palomo-Mart\u00ednez","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"1\u20133","key":"10.1016\/j.ejor.2026.01.018_bib0016","first-page":"78","article-title":"Traveling purchaser problem","volume":"18","author":"Ramesh","year":"1981","journal-title":"Opsearch"},{"key":"10.1016\/j.ejor.2026.01.018_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.tre.2023.103394","article-title":"A branch-and-cut algorithm for the dial-a-ride problem with incompatible customer types","volume":"181","author":"Schulz","year":"2024","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"10.1016\/j.ejor.2026.01.018_bib0018","series-title":"Proceedings of the IEEE international conference of circuits and computers","first-page":"149","article-title":"Integer programming formulations of the traveling salesman problem","author":"Wong","year":"1980"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726000421?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221726000421?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:13:15Z","timestamp":1774991595000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221726000421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["S0377221726000421"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2026.01.018","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Two-index formulations for the traveling purchaser problem with incompatibility constraints","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.01.018","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"}]}}