scientific article; zbMATH DE number 1054956

zbMATH Open0877.90071MaRDI QIDQ4350076FDOQ4350076

Martin Dam, Martin Zachariasen

Publication date: 28 August 1997

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

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)

Cited In (10)

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

Uses Software

• TSPLIB

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the solution of traveling salesman problems 👍 👎
• A tabu search heuristic for the undirected selective travelling salesman problem 👍 👎
• On the approximability of the traveling salesman problem 👍 👎
• Fast Algorithms for Geometric Traveling Salesman Problems 👍 👎
• Tabu search performance on the symmetric travelling salesman problem 👍 👎
• The geometric maximum traveling salesman problem 👍 👎
• El problema del agente viajero: un algoritmo determinístico usando búsqueda tabú 👍 👎

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)