LKH

swMATH4735MaRDI QIDQ16903FDOQ16903

Author name not available (Why is that?)

Official website: http://www.akira.ruc.dk/~keld/research/LKH/

Described by source

• An effective implementation of the Lin-Kernighan traveling salesman heuristic

Cited In (only showing first 100 items - show all)

• 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
• Concorde
• BG-WalkSAT
• TSPTW
• TSP software
• simannf90
• Scatter Search
• VRP
• GATE
• Cardinal
• PLplot
• RngSteam
• race
• TTTPLOTS
• Tabu search
• ACOTSP
• BBMCL
• OsiSolver
• CVRPSP
• SAP APO
• GTSP Instances Library
• OR-tools
• On the recoverable robust traveling salesman problem
• A decomposition-based heuristic for the multiple-product inventory-routing problem
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
• A simulated annealing heuristic for the open location-routing problem
• FrogCOL
• POPMUSIC
• flacco
• GTSP-LIB
• Eureqa
• MOIP_AIRA
• ISUD
• Ejection chain and filter-and-fan methods in combinatorial optimization
• MATILDA
• NLocalSAT
• Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem
• The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
• Social structure optimization in team formation
• A library of local search heuristics for the vehicle routing problem
• Ejection chain and filter-and-fan methods in combinatorial optimization
• Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
• Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm
• A concise guide to the Traveling Salesman Problem
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Lower tolerance-based branch and bound algorithms for the ATSP
• An efficient heuristic algorithm for the bottleneck traveling salesman problem
• On line routing per mobile phone a case on subsequent deliveries of newspapers
• GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
• Genetic Algorithms and Genetic Programming
• The split delivery vehicle routing problem with three-dimensional loading constraints
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• 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

This page was built for software: LKH