Pages that link to "Item:Q1586139"

The following pages link to Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem (Q1586139):

Displaying 34 items.

• GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
• The hierarchical traveling salesman problem (Q375993) (← links)
• The traveling salesman problem with flexible coloring (Q444446) (← links)
• An improved approximation algorithm for the clustered traveling salesman problem (Q456175) (← links)
• An exact algorithm for the clustered travelling salesman problem (Q505157) (← links)
• Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
• Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
• On residual approximation in solution extension problems (Q1631675) (← links)
• Approximation algorithms for general cluster routing problem (Q2019492) (← links)
• Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
• A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
• On the clustered Steiner tree problem (Q2355992) (← links)
• Order sequencing on a unidirectional cyclical picking line (Q2356209) (← 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)
• Traveling salesman path problems (Q2476987) (← links)
• Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
• Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
• An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
• A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots (Q2802244) (← links)
• Reassembling Trees for the Traveling Salesman (Q2806177) (← links)
• On the Clustered Steiner Tree Problem (Q2867108) (← links)
• On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
• Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892) (← links)
• Picker Routing in AGV-Assisted Order Picking Systems (Q5084661) (← links)
• On the Hardness of Reoptimization (Q5448637) (← links)
• An approximation algorithm for the clustered path travelling salesman problem (Q6039533) (← links)
• Heuristics for a cash-collection routing problem with a cluster-first route-second approach (Q6099456) (← links)
• The Clustered Selected-Internal Steiner Tree Problem (Q6114856) (← links)
• Achieving feasibility for clustered traveling salesman problems using PQ‐trees (Q6139372) (← links)
• The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)