The following pages link to LKH (Q16903):
Displaying 50 items.
- The salesman and the tree: the importance of search in CP (Q272000) (← links)
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
- A distribution-free TSP tour length estimation model for random graphs (Q319156) (← links)
- The \(k\)-dissimilar vehicle routing problem (Q319301) (← links)
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem (Q319379) (← links)
- The multi-compartment vehicle routing problem with flexible compartment sizes (Q319854) (← links)
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach (Q320623) (← links)
- On the recoverable robust traveling salesman problem (Q331985) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- A decomposition-based heuristic for the multiple-product inventory-routing problem (Q337420) (← links)
- Ambulance routing for disaster response with patient groups (Q337463) (← links)
- A simulated annealing heuristic for the open location-routing problem (Q337651) (← links)
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement (Q342348) (← links)
- Social structure optimization in team formation (Q342472) (← links)
- Using Markov chains to analyze the effectiveness of local search algorithms (Q429676) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Extremal values of global tolerances in combinatorial optimization with an additive objective function (Q453633) (← links)
- Improved filtering for weighted circuit constraints (Q487627) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem (Q504159) (← links)
- Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- A framework for analyzing sub-optimal performance of local search algorithms (Q548682) (← links)
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions (Q635174) (← links)
- Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
- Sequencing and scheduling for filling lines in dairy production (Q691446) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- Global versus local search: the impact of population sizes on evolutionary algorithm performance (Q727394) (← links)
- Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- Multiprogramming genetic algorithm for optimization problems with permutation property (Q870194) (← links)
- Synchronized routing of seasonal products through a production/distribution network (Q926350) (← links)
- Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem (Q941025) (← links)
- The petrol station replenishment problem with time windows (Q955625) (← links)
- Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems (Q1009187) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems (Q1403285) (← links)
- Traveling salesman problems with PageRank distance on complex networks reveal community structure (Q1620011) (← links)
- Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623) (← links)
- An iterated local search for the traveling salesman problem with release dates and completion time minimization (Q1651639) (← links)
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem (Q1652128) (← links)
