Domination analysis of some heuristics for the traveling salesman problem
type: Item
instance of: scholarly article
title: Domination analysis of some heuristics for the traveling salesman problem
zbMATH Open document ID: 1041.90063
DOI: 10.1016/S0166-218X(01)00268-2
published in: Discrete Applied Mathematics
publication date: 2002-06-24T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1758390
author: Abraham P. Punnen
author: Santosh N. Kabadi
MaRDI profile type: Publication
cites work: Implementation of a linear time algorithm for certain generalized traveling salesman problems
cites work: The travelling salesman and the PQ-tree.
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: Local search and the local structure of NP-complete problems
cites work: Ejection chains, reference structures and alternating path methods for traveling salesman problems
cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
cites work: Efficiency of a local algorithm for solving the traveling salesman problem
cites work: Exponential neighbourhood local search for the traveling salesman problem
cites work: Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
cites work: Gilmore-Gomory type traveling salesman problems
cites work: Q3677509
cites work: The traveling salesman problem: new polynomial approximation algorithms and domination analysis
cites work: Q4116281
cites work: P-Complete Approximation Problems
cites work: Q5181524
description: scientific article; zbMATH DE number 1758390