scientific article; zbMATH DE number 1054956

MaRDI QIDQ4350076zbMATHFDO

Authors Martin Dam, Martin Zachariasen

Publication date 28 August 1997

zbMATH Keywords

tabu searchflower transitiongeometric traveling salesman

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1145369
• Tabu search performance on the symmetric travelling salesman problem
• The geometric maximum traveling salesman problem
• A tabu search heuristic for the undirected selective travelling salesman problem
• On the solution of traveling salesman problems
• Fast Algorithms for Geometric Traveling Salesman Problems
• The traveling salesman problem: a deterministic algorithm using tabu search
• On the approximability of the traveling salesman problem
• scientific article; zbMATH DE number 1302201
• scientific article; zbMATH DE number 1082103

Cited in

(11)

• A survey of very large-scale neighborhood search techniques
• Metaheuristics: A bibliography
• Guided local search and its application to the traveling salesman problem
• A tabu search algorithm for maximum parsimony phylogeny inference
• A tabu search with geometry‐based sparsification methods for angular traveling salesman problems
• Expanding neighborhood GRASP for the traveling salesman problem
• Tabu search performance on the symmetric travelling salesman problem
• Genetic operators for combinatorial optimization in TSP and microarray gene ordering
• A discrete gravitational search algorithm for solving combinatorial optimization problems
• Heuristics for single-pass welding task sequencing
• A hybrid genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem

Describes a project that uses

Uses Software

• TSPLIB

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 Q4350076)