swMATH4735MaRDI QIDQ16903FDOQ16903
Author name not available (Why is that?)
Official website: http://www.akira.ruc.dk/~keld/research/LKH/
Cited In (only showing first 100 items - show all)
- Comparison of tabu/2-opt heuristic and optimal tree search method for assignment problems
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
- Sequencing and scheduling for filling lines in dairy production
- Title not available (Why is that?)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem
- Computing compatible tours for the symmetric traveling salesman problem
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem
- A framework for analyzing sub-optimal performance of local search algorithms
- An iterated local search for the traveling salesman problem with release dates and completion time minimization
- Optimal TSP tour length estimation using standard deviation as a predictor
- Using Markov chains to analyze the effectiveness of local search algorithms
- Cvrplib
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- Finite-time performance analysis of static simulated annealing algorithms
- Continuous relaxations for the traveling salesman problem
- Pattern discrete and mixed hit-and-run for global optimization
- Multiprogramming genetic algorithm for optimization problems with permutation property
- Global versus local search: the impact of population sizes on evolutionary algorithm performance
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering
- A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem
- Theoretical insights into the augmented-neural-network approach for combinatorial optimization
- Extremal values of global tolerances in combinatorial optimization with an additive objective function
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- A two-phase solution algorithm for the flexible periodic vehicle routing problem
- Solving large batches of traveling salesman problems with parallel and distributed computing
- A survey of the standard location-routing problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Traveling salesman problems with PageRank distance on complex networks reveal community structure
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem
- Reinforcement learning for combinatorial optimization: a survey
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem
- Designing efficient order picking systems by combining planning problems: state-of-the-art classification and review
- A tabu search algorithm for the single vehicle routing allocation problem
- Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
- ALNS
- LKH3
- CSGNet
- ACVIZ
- CAPOPT
- HGS-CVRP
- HHBQP
- SeaPearl
- The traveling purchaser problem and its variants
- A discrete gravitational search algorithm for solving combinatorial optimization problems
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- Reducing the generalised Sudoku problem to the Hamiltonian cycle problem
- A neural-network-based approach to the double traveling salesman problem.
- Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
- A computational software system to design order picking warehouses
- Deep policy dynamic programming for vehicle routing problems
- Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
- Multiple depot ring star problem: a polyhedral study and an exact algorithm
- Neural large neighborhood search for routing problems
- Expanding neighborhood search-GRASP for the probabilistic traveling salesman problem
- A linearithmic heuristic for the travelling salesman problem
- Embedded local search approaches for routing optimization
- Learning to sparsify travelling salesman problem instances
- Graph-Theoretic Concepts in Computer Science
- Generalization of machine learning for problem reduction: a case study on travelling salesman problems
- Visiting near-optimal solutions using local search algorithms
- Chained Lin-Kernighan for large traveling salesman problems
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
- Generating subtour elimination constraints for the TSP from pure integer solutions
- Optimal TSP tour length estimation using Sammon maps
- The salesman and the tree: the importance of search in CP
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- The generalized covering salesman problem
- Improved filtering for weighted circuit constraints
- Algorithm runtime prediction: methods \& evaluation
- Locating a cycle in a transportation or a telecommunications network
- Heuristiques pour le Problème du Vendeurm-Péripatétique
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem
- Title not available (Why is that?)
- Two-phase Pareto local search for the biobjective traveling salesman problem
- A tolerance-based heuristic approach for the weighted independent set problem
- CPU Benchmarks
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
- Efficient heuristics for Median Cycle Problems
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
- A distribution-free TSP tour length estimation model for random graphs
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
- The \(k\)-dissimilar vehicle routing problem
- The multi-compartment vehicle routing problem with flexible compartment sizes
- Synchronized routing of seasonal products through a production/distribution network
- The petrol station replenishment problem with time windows
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- Ambulance routing for disaster response with patient groups
- Expanding neighborhood GRASP for the traveling salesman problem
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- GRASP
- TSPLIB
- BIANCA
This page was built for software: LKH
