The hierarchical traveling salesman problem
From MaRDI portal
Publication:375993
DOI10.1007/s11590-012-0553-xzbMath1280.90101OpenAlexW2149172844MaRDI QIDQ375993
Yupei Xiong, Kiran Panchamgam, Benjamin Dussault, Edward A. Wasil, Bruce L. Golden
Publication date: 1 November 2013
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0553-x
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (6)
The target visitation arc routing problem ⋮ Ambulance routing for disaster response with patient groups ⋮ A general variable neighborhood search variants for the travelling salesman problem with draft limits ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ Solving the clustered traveling salesman problem with ‐relaxed priority rule ⋮ New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule
Cites Work
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
- On the hierarchical Chinese postman problem with linear ordered classes
This page was built for publication: The hierarchical traveling salesman problem
