New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule

DOI10.1007/s10878-023-01066-xOpenAlexW4385157354MaRDI QIDQ6176400

Nathalie Bostel, Minh Hoàng Hà, Thanh Tan Doan, Vu Hoang Vuong Nguyen

Publication date: 22 August 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-023-01066-x

zbMATH Keywords

traveling salesman problemmixed integer linear programmingiterated local search\(d\)-relaxed priority rule

Mathematics Subject Classification ID

Mixed integer programming (90C11) Combinatorial optimization (90C27)

Cites Work

• The hierarchical traveling salesman problem
• Iterated local search for the team orienteering problem with time windows
• A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
• The traveling salesman problem and its variations.
• TSPLIB—A Traveling Salesman Problem Library
• Some applications of the clustered travelling salesman problem
• Solving the clustered traveling salesman problem with ‐relaxed priority rule
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule