This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2026-232657
If you've NEVER registered a DOI in your Lattes, check our tutorial!The Multiple Traveling Salesmen Problem with Shared Vertex Costs is introduced as a novel extension of the classical Traveling Salesman Problem that integrates routing decisions, service times and cost-sharing among salesmen. In this variant, node-visiting costs are incurred with the presence of agents over consecutive days, and multiple salesmen may simultaneously visit the same node, allowing these costs to be shared among them. In this work, we formally define the problem and propose a mixed-integer linear programming formulation together with strengthening techniques and a upper bound to optimal solution. To evaluate the proposed formulation, we generated a benchmark dataset derived from TSPLIB instances.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper