Transformations of generalized ATSP into ATSP.
type: Item
instance of: scholarly article
title: Transformations of generalized ATSP into ATSP.
zbMATH Open document ID: 1033.90097
DOI: 10.1016/S0167-6377(03)00031-2
author: D. Massart
published in: Operations Research Letters
publication date: 2003-08-13T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1963721
zbMATH Keywords: TSP
zbMATH Keywords: Generalized TSP
zbMATH Keywords: Domination analysis
zbMATH Keywords: Heuristics
describes a project that uses: Concorde
describes a project that uses: TSPLIB
MaRDI profile type: Publication
cites work: On the solution of traveling salesman problems
cites work: Process planning for rotational parts using the generalized travelling salesman problem
cites work: An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
cites work: The symmetric generalized traveling salesman polytope
cites work: A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
cites work: Q4461915
cites work: Construction heuristics for the asymmetric TSP.
cites work: The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms
cites work: The traveling salesman problem and its variations
cites work: Q4461908
cites work: Some Applications of the Generalized Travelling Salesman Problem
cites work: Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
cites work: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
cites work: Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem
cites work: Q5187226
cites work: Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem
cites work: A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem
cites work: An Efficient Transformation Of The Generalized Traveling Salesman Problem
cites work: Domination analysis of some heuristics for the traveling salesman problem
cites work: TSP heuristics: domination analysis and complexity
cites work: TSPLIB—A Traveling Salesman Problem Library
full work available at URL: s0167-6377(03)00031-2
OpenAlex ID: W2048296377
description: scientific article; zbMATH DE number 1963721