Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
From MaRDI portal
(Redirected from Publication:621685)
Recommendations
- A modified Lin--Kernighan traveling-salesman heuristic
- The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- A linearithmic heuristic for the travelling salesman problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Chained Lin-Kernighan for large traveling salesman problems
- scientific article; zbMATH DE number 91020
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- Approximation schemes for the generalized traveling salesman problem
Cites work
- scientific article; zbMATH DE number 1003245 (Why is no real title available?)
- scientific article; zbMATH DE number 2064411 (Why is no real title available?)
- scientific article; zbMATH DE number 2064412 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
- A memetic algorithm for the generalized traveling salesman problem
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- A new relaxation method for the generalized minimum spanning tree problem
- A random-key genetic algorithm for the generalized traveling salesman problem
- An Algorithm for the Three-Index Assignment Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Local search heuristics for the multidimensional assignment problem
- Some Applications of the Generalized Travelling Salesman Problem
- TSPLIB—A Traveling Salesman Problem Library
- The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach
- The symmetric generalized traveling salesman polytope
- Transformations of generalized ATSP into ATSP.
Cited in
(16)- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
- A comprehensive survey on the generalized traveling salesman problem
- Selective generalized travelling salesman problem
- A discrete state transition algorithm for generalized traveling salesman problem
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem
- Embedding a chained Lin-Kernighan algorithm into a distributed algorithm
- Directed in-out graphs of optimal size
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- A modified Lin--Kernighan traveling-salesman heuristic
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem
- A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP
- Reducing the size of combinatorial optimization problems using the operator vaccine by fuzzy selector with adaptive heuristics
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
This page was built for publication: Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q621685)
