Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
type: Item
instance of: scholarly article
title: Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
zbMATH Open document ID: 1208.90148
author: Daniel Karapetyan
author: G. Gutin
published in: European Journal of Operational Research
publication date: 2011-01-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5842694
zbMATH Keywords: heuristics
zbMATH Keywords: Lin-Kernighan
zbMATH Keywords: generalized traveling salesman problem
zbMATH Keywords: combinatorial optimization
describes a project that uses: GTSP Instances Library
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.08.011
OpenAlex ID: W2065862878
cites work: An Algorithm for the Three-Index Assignment Problem
cites work: Transformations of generalized ATSP into ATSP.
cites work: A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
cites work: Q4335205
cites work: The symmetric generalized traveling salesman polytope
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: A memetic algorithm for the generalized traveling salesman problem
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
cites work: Q4461911
cites work: Local Search Heuristics for the Multidimensional Assignment Problem
cites work: Some Applications of the Generalized Travelling Salesman Problem
cites work: Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
cites work: An Efficient Transformation Of The Generalized Traveling Salesman Problem
cites work: A new relaxation method for the generalized minimum spanning tree problem
cites work: Q4461910
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: An efficient composite heuristic for the symmetric generalized traveling salesman problem
cites work: The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
cites work: A random-key genetic algorithm for the generalized traveling salesman problem
cites work: An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
DOI: 10.1016/J.EJOR.2010.08.011
Recommended article: A modified Lin--Kernighan traveling-salesman heuristic
Recommended article: The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
Recommended article: An effective implementation of the Lin-Kernighan traveling salesman heuristic
Recommended article: Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
Recommended article: A linearithmic heuristic for the travelling salesman problem
Recommended article: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
Recommended article: Chained Lin-Kernighan for large traveling salesman problems
Recommended article: Q4017163
Recommended article: Implementation of a linear time algorithm for certain generalized traveling salesman problems
Recommended article: Approximation schemes for the generalized traveling salesman problem
description: scientific article; zbMATH DE number 5842694