Solving the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule
Published in International Transactions in Operational Research, 2020
This paper addresses the clustered traveling salesman problem using a d-relaxed priority rule, contributing to optimization techniques in logistics.
Recommended citation: Minh Hoàng Hà, Hoa Nguyen Phuong, Huyen Tran Ngoc Nhat, André Langevin, Martin Trépanier. (2023). “Solving the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule.” International Transactions in Operational Research.
Recommended citation: Minh Hoàng Hà, Hoa Nguyen Phuong, Huyen Tran Ngoc Nhat, André Langevin, Martin Trépanier. (2023). "Solving the Clustered Traveling Salesman Problem with d-Relaxed Priority Rule." International Transactions in Operational Research.
Download Paper