The following pages link to (Q4461911):
Displaying 50 items.
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- The parameterized complexity of local search for TSP, more refined (Q378245) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Instance-specific multi-objective parameter tuning based on fuzzy logic (Q439495) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
- An optimization approach for communal home meal delivery service: A case study (Q837090) (← links)
- Multicriteria tour planning for mobile healthcare facilities in a developing country (Q864026) (← links)
- Searching the \(k\)-change neighborhood for TSP is W[1]-hard (Q924881) (← links)
- Subsets of rectifiable curves in Hilbert space-the analyst's TSP (Q926387) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem (Q1026674) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem (Q1659213) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- The Gestalt heuristic: emerging abstraction to improve combinatorial search (Q1761739) (← links)
- Extended neighborhood: Definition and characterization (Q1764249) (← links)
- Data structures and ejection chains for solving large-scale traveling salesman problems (Q1887873) (← links)
- A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
- An efficient evolutionary algorithm for the ring star problem (Q2356203) (← links)
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
- On estimating the distribution of optimal traveling salesman tour lengths using heuristics (Q2462111) (← links)
- Multi-objective vehicle routing problems (Q2480968) (← links)
- Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
- Iterated local search for the quadratic assignment problem (Q2503224) (← links)
- Hybrid metaheuristics for the vehicle routing problem with stochastic demands (Q2506217) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices (Q2572862) (← links)
- A note on single alternating cycle neighborhoods for the TSP (Q2573008) (← links)
- A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem (Q2583172) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- Discrete heat transfer search for solving travelling salesman problem (Q2668543) (← links)
- Min-weight double-tree shortcutting for metric TSP: bounding the approximation ratio (Q2839206) (← links)
- Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic (Q3448843) (← links)
- Locating a cycle in a transportation or a telecommunications network (Q3593375) (← links)
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem (Q3643507) (← links)
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
- A Sensitive Metaheuristic for Solving a Large Optimization Problem (Q5448681) (← links)
- (Q5743492) (← links)
