scientific article; zbMATH DE number 1003245

zbMATH Open0867.90113MaRDI QIDQ4335205FDOQ4335205

Authors: Barun Chandra, Craig A. Tovey, Howard Karloff 

Publication date: 23 April 1997

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

heuristictraveling salesmanlocal search with \(k\)-change neighborhoods

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

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
• Title not available (Why is that?)
• 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)