Pages that link to "Item:Q456175"
From MaRDI portal
The following pages link to An improved approximation algorithm for the clustered traveling salesman problem (Q456175):
Displaying 17 items.
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365) (← links)
- Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139) (← links)
- Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- On the minimum routing cost clustered tree problem (Q2359809) (← links)
- A note on approximation algorithms of the clustered traveling salesman problem (Q2398506) (← links)
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799) (← links)
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892) (← links)
- Picker Routing in AGV-Assisted Order Picking Systems (Q5084661) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6039533) (← links)
- The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6167001) (← links)
- New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule (Q6176400) (← links)
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)
- A hybrid metaheuristic for the clustered travelling salesman problem (Q6606574) (← links)
