The following pages link to LKH (Q16903):
Displaying 50 items.
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization (Q2271837) (← links)
- The split delivery vehicle routing problem with three-dimensional loading constraints (Q2282545) (← links)
- Continuous relaxations for the traveling salesman problem (Q2296989) (← links)
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP (Q2307980) (← links)
- Dynamic traveling salesman problem with stochastic release dates (Q2327624) (← links)
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot (Q2357926) (← links)
- Generating subtour elimination constraints for the TSP from pure integer solutions (Q2358189) (← links)
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering (Q2383954) (← links)
- The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
- Order Batching and Picker Routing in manual order picking systems: the benefits of integrated routing (Q2401327) (← links)
- A novel bio-inspired approach based on the behavior of mosquitoes (Q2446375) (← links)
- Determination of the candidate arc set for the asymmetric traveling salesman problem (Q2485161) (← links)
- Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
- A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse (Q2514749) (← links)
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
- A computational software system to design order picking warehouses (Q2668754) (← links)
- Reinforcement learning for combinatorial optimization: a survey (Q2669503) (← links)
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood (Q2669771) (← links)
- Capping methods for the automatic configuration of optimization algorithms (Q2669790) (← links)
- Guidelines for the computational testing of machine learning approaches to vehicle routing problems (Q2670511) (← links)
- Crowdsourced humanitarian relief vehicle routing problem (Q2676364) (← links)
- Optimal TSP tour length estimation using standard deviation as a predictor (Q2676394) (← links)
- A branch-and-cut approach for the distributed no-wait flowshop scheduling problem (Q2676404) (← links)
- Optimal TSP tour length estimation using Sammon maps (Q2679001) (← links)
- Using regression models to understand the impact of route-length variability in practical vehicle routing (Q2679006) (← links)
- Dynamic graph conv-LSTM model with dynamic positional encoding for the large-scale traveling salesman problem (Q2688704) (← links)
- A study on the effects of normalized TSP features for automated algorithm selection (Q2699964) (← links)
- A neural-network-based approach to the double traveling salesman problem. (Q2780866) (← links)
- The generalized covering salesman problem (Q2815466) (← links)
- A binomial distribution model for the traveling salesman problem based on frequency quadrilaterals (Q2819862) (← links)
- Chained Lin-Kernighan for large traveling salesman problems (Q2884550) (← links)
- Comparison of tabu/2-opt heuristic and optimal tree search method for assignment problems (Q2903985) (← links)
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
- Visiting near-optimal solutions using local search algorithms (Q3298635) (← links)
- Special Frequency Quadrilaterals and an Application (Q3305469) (← links)
- A tabu search algorithm for the single vehicle routing allocation problem (Q3512571) (← links)
- A concise guide to the Traveling Salesman Problem (Q3582631) (← links)
- Locating a cycle in a transportation or a telecommunications network (Q3593375) (← links)
- Genetic Algorithms and Genetic Programming (Q3618841) (← links)
- Heuristiques pour le Problème du Vendeur<i>m</i>-Péripatétique (Q3621973) (← links)
- A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem (Q3625026) (← links)
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem (Q3643507) (← links)
- (Q4461911) (← links)
- (Q4461912) (← links)
- Optimization of logistics services in hospitals (Q4608286) (← links)
- A construction for directed in-out subgraphs of optimal size (Q4622626) (← links)
- Efficient heuristics for Median Cycle Problems (Q4661131) (← links)
- Application of the out-of-kilter algorithm to the asymmetric traveling salesman problem (Q4661165) (← links)
- Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles (Q5006572) (← links)
