Ejection chains, reference structures and alternating path methods for traveling salesman problems
type: Item
instance of: scholarly article
title: Ejection chains, reference structures and alternating path methods for traveling salesman problems
zbMATH Open document ID: 0846.90117
DOI: 10.1016/0166-218X(94)00037-E
author: Fred Glover
published in: Discrete Applied Mathematics
publication date: 1996-10-03T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 897382
zbMATH Keywords: traveling salesman
zbMATH Keywords: neighbourhood search
zbMATH Keywords: ejection chain procedures
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q5596091
cites work: On the use of augmenting chains in chain packings
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Matroid Intersection
cites work: A parallel tabu search algorithm for large traveling salesman problems
cites work: Q5608582
cites work: A user's guide to tabu search
cites work: Q3720323
cites work: Parallel concepts in graph theory
cites work: Tabu search for the multilevel generalized assignment problem
cites work: Q4136942
cites work: Q3677509
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem
description: scientific article; zbMATH DE number 897382