Pages that link to "Item:Q2884550"
From MaRDI portal
The following pages link to Chained Lin-Kernighan for Large Traveling Salesman Problems (Q2884550):
Displaying 39 items.
- TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
- An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
- Discovering the suitability of optimisation algorithms by learning from evolved instances (Q408979) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- Efficiently solving the traveling thief problem using hill climbing and simulated annealing (Q781909) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- An effective local search for the maximum clique problem (Q1041822) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- Dubins traveling salesman problem with neighborhoods: a graph-based approach (Q1736545) (← links)
- An efficient local search for the feedback vertex set problem (Q1736593) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- The packing while traveling problem (Q1751654) (← links)
- Exact algorithms for the order picking problem (Q1782167) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- POPMUSIC for the travelling salesman problem (Q1991147) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem (Q2233517) (← links)
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems (Q2241908) (← links)
- A linearithmic heuristic for the travelling salesman problem (Q2242243) (← links)
- A location-routing problem in glass recycling (Q2259043) (← links)
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980) (← links)
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering (Q2383954) (← links)
- Proper balance between search towards and along Pareto front: biobjective TSP case study (Q2400011) (← links)
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem (Q2571201) (← links)
- A note on single alternating cycle neighborhoods for the TSP (Q2573008) (← links)
- A weighted-sum method for solving the bi-objective traveling thief problem (Q2669668) (← links)
- A Genetic Algorithm for Multi-component Optimization Problems: The Case of the Travelling Thief Problem (Q3304185) (← links)
- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP (Q5458509) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5899416) (← links)
- Ejection chain and filter-and-fan methods in combinatorial optimization (Q5900890) (← links)
- Exponential neighborhood search for consecutive block minimization (Q6082185) (← links)
