Pages that link to "Item:Q1812290"
From MaRDI portal
The following pages link to Approximation algorithms for the traveling salesman problem (Q1812290):
Displaying 24 items.
- Differential approximation results for the traveling salesman and related problems (Q294874) (← links)
- A survey on the structure of approximation classes (Q458503) (← links)
- Efficiency of a local algorithm for solving the traveling salesman problem (Q916576) (← links)
- A better differential approximation ratio for symmetric TSP (Q924134) (← links)
- Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
- Differential approximation results for the traveling salesman problem with distances 1 and 2 (Q1869490) (← links)
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem (Q1884968) (← links)
- Combining local search and elicitation for multi-objective combinatorial optimization (Q2290362) (← links)
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems (Q2446858) (← links)
- On the approximability of the traveling salesman problem (Q2495698) (← links)
- \(z\)-approximations (Q2775899) (← links)
- Generalized traveling salesman problem reduction algorithms (Q2867371) (← links)
- (Q2991763) (← links)
- (Q3440942) (← links)
- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem (Q3503857) (← links)
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem (Q3638885) (← links)
- Fast Algorithms for Geometric Traveling Salesman Problems (Q4024311) (← links)
- (Q4297219) (← links)
- (Q4472495) (← links)
- (Q4517278) (← links)
- (Q4852853) (← links)
- (Q4934634) (← links)
- THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION (Q5151281) (← links)
- Approximation Polynomial Algorithms for Some Modifications of TSP (Q5392089) (← links)
