Pages that link to "Item:Q1043852"

The following pages link to General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852):

Displaying 33 items.

• Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
• Certifying algorithms (Q465678) (← links)
• Improved filtering for weighted circuit constraints (Q487627) (← links)
• On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
• Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
• Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
• Global versus local search: the impact of population sizes on evolutionary algorithm performance (Q727394) (← links)
• Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
• POPMUSIC for the travelling salesman problem (Q1991147) (← links)
• Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2026705) (← links)
• Routing automated lane-guided transport vehicles in a warehouse handling returns (Q2030483) (← links)
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
• Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange (Q2159525) (← links)
• A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
• A linearithmic heuristic for the travelling salesman problem (Q2242243) (← links)
• A tolerance-based heuristic approach for the weighted independent set problem (Q2253961) (← links)
• The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
• Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
• An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
• An iterative matheuristic for the inventory routing problem (Q2668692) (← links)
• Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
• \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices (Q2695590) (← links)
• A study on the effects of normalized TSP features for automated algorithm selection (Q2699964) (← links)
• Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
• Edge Elimination in TSP Instances (Q2945197) (← links)
• Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP (Q5075760) (← links)
• Rearrangement events on circular genomes (Q6078306) (← links)
• A reinforced hybrid genetic algorithm for the traveling salesman problem (Q6106563) (← links)
• A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381) (← links)
• Applying topological data analysis to local search problems (Q6154230) (← links)
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
• Solving the large-scale min-max \(k\)-rural postman problem for snow plowing (Q6496352) (← links)