An exact algorithm for the clustered travelling salesman problem
type: Item
instance of: scholarly article
title: An exact algorithm for the clustered travelling salesman problem
zbMATH Open document ID: 1353.90124
author: Zakir Hussain Ahmed
published in: Opsearch
publication date: 2017-01-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6676252
zbMATH Keywords: clustered travelling salesman problem
zbMATH Keywords: exact
zbMATH Keywords: optimal
zbMATH Keywords: lexisearch algorithm
zbMATH Keywords: bound
describes a project that uses: TSPLIB
MaRDI profile type: Publication
full work available at URL: s12597-012-0107-0
OpenAlex ID: W1993548687
cites work: A data-guided lexisearch algorithm for the asymmetric traveling salesman problem
cites work: A data-guided lexisearch algorithm for the bottleneck travelling salesman problem
cites work: The travelling salesman problem with precedence constraints.
cites work: A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
cites work: Two-level genetic algorithm for clustered traveling salesman problem with application in large-scale TSPs
cites work: The traveling salesman problem with backhauls
cites work: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem
cites work: The symmetric clustered traveling salesman problem
cites work: An algorithm for the traveling salesman problem with pickup and delivery customers
cites work: Some applications of the clustered travelling salesman problem
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Procedures for travelling salesman problems with additional constraints
cites work: A comparison of solution methods for the assortment problem
DOI: 10.1007/S12597-012-0107-0
description: scientific article; zbMATH DE number 6676252