Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems

Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems

Multiple traveling salesperson problems (<i>m</i>TSP) are a collection of problems that generalize the classical traveling salesperson problem (TSP). In a nutshell, an <i>m</i>TSP variant seeks a minimum cost collection of <i>m</i> paths that visit all vertices of...

Full description

Bibliographic Details
Main Authors: José Alejandro Cornejo-Acosta, Jesús García-Díaz, Julio César Pérez-Sansalvador, Carlos Segura
Format: Article
Language:English
Published: MDPI AG 2023-07-01
Series:Mathematics
Subjects:
integer programming
multiple traveling salesperson problem
depot-free <i>m</i>TSP
Online Access:https://www.mdpi.com/2227-7390/11/13/3014

Similar Items

Similar Items