Relaxed tours and path ejections for the traveling salesman problem
type: Item
instance of: scholarly article
title: Relaxed tours and path ejections for the traveling salesman problem
zbMATH Open document ID: 0991.90104
DOI: 10.1016/S0377-2217(97)00288-9
author: César Rego
published in: European Journal of Operational Research
publication date: 2002-08-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 1782822
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: tabu search
zbMATH Keywords: ejection chains
describes a project that uses: TSPLIB
describes a project that uses: VRP
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q3277097
cites work: Fast Clustering Algorithms
cites work: Covers and packings in a family of sets
cites work: Paths, Trees, and Flowers
cites work: Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move
cites work: Solution of large-scale symmetric travelling salesman problems
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: Q5187226
cites work: Tabu search for the multilevel generalized assignment problem
cites work: The vehicle routing problem: An overview of exact and approximate algorithms
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A modified Lin--Kernighan traveling-salesman heuristic
cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
cites work: Q4739657
cites work: Q4350082
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: The traveling salesman. Computational solutions for RSP applications
cites work: A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
Recommended article: Continuous relaxations for the traveling salesman problem
Recommended article: Q4795405
Recommended article: Ejection chains, reference structures and alternating path methods for traveling salesman problems
Recommended article: On the traveling salesman problem with a relaxed Monge matrix
Recommended article: A complete search method for the relaxed traveling tournament problem
Recommended article: On Semidefinite Programming Relaxations of the Traveling Salesman Problem
Recommended article: Critical graphs, matchings and tours or a hierarchy of relaxations for the travelling salesman problem
Recommended article: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
Recommended article: Reoptimization of Minimum and Maximum Traveling Salesman’s Tours
Recommended article: Reoptimization of minimum and maximum traveling salesman's tours
description: scientific article; zbMATH DE number 1782822