scientific article; zbMATH DE number 1003245
From MaRDI portal
Publication:4335205
Recommendations
- New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
- Nonoblivious 2-opt heuristics for the traveling salesman problem
- scientific article; zbMATH DE number 1054958
- On the neighborhood structure of the traveling salesman problem generated by local search moves
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
Cited in
(16)- Searching the \(k\)-change neighborhood for TSP is W[1]-hard
- Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood
- Symmetric weight constrained traveling salesman problem: Local search
- scientific article; zbMATH DE number 7651222 (Why is no real title available?)
- Large-step Markov chains for the TSP incorporating local search heuristics
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Classical simulated annealing using quantum analogues
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- The parameterized complexity of local search for TSP, more refined
- A note on single alternating cycle neighborhoods for the TSP
- Fine-grained complexity analysis of two classic TSP variants
- Quick updates for \(p\)-opt TSP heuristics
- Multiple \(k\)-opt evaluation multiple \(k\)-opt moves with GPU high performance local search to large-scale traveling salesman problems
- Nonoblivious 2-opt heuristics for the traveling salesman problem
- New TSP construction heuristics and their relationships to the 2-Opt
- On the neighborhood structure of the traveling salesman problem generated by local search moves
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4335205)
