A new heuristic for the traveling salesman problem
From MaRDI portal
Publication:5202515
DOI10.1051/ro/1990240302451zbMath0724.90055OpenAlexW93177885MaRDI QIDQ5202515
No author found.
Publication date: 1990
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104984
Combinatorial optimization (90C27) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem, Routing problems: A bibliography, A new asymmetric pyramidally solvable class of the traveling salesman problem, Upper bounds on ATSP neighborhood size., The travelling salesman and the PQ-tree, Construction heuristics for the asymmetric TSP., A survey of very large-scale neighborhood search techniques, TSP tour domination and Hamilton cycle decompositions of regular digraphs, Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood, Fast local search algorithms for the handicapped persons transportation problem, Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
