Experimental analysis of heuristics for the bottleneck traveling salesman problem
type: Item
instance of: scholarly article
title: Experimental analysis of heuristics for the bottleneck traveling salesman problem
zbMATH Open document ID: 1358.90170
author: John LaRusic
author: Abraham P. Punnen
author: Eric Aubanel
published in: Journal of Heuristics
publication date: 2017-04-04T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6700353
zbMATH Keywords: traveling salesman problem
zbMATH Keywords: bottleneck TSP
zbMATH Keywords: experimental analysis
zbMATH Keywords: maximum scatter TSP
zbMATH Keywords: heuristic algorithms
describes a project that uses: LKH
describes a project that uses: TSPLIB
describes a project that uses: Concorde
MaRDI profile type: Publication
full work available at URL: s10732-012-9194-6
OpenAlex ID: W1995945236
cites work: On the Maximum Scatter Traveling Salesperson Problem
cites work: Q4461907
cites work: An Algorithm for the Bottleneck Traveling Salesman Problem
cites work: Q3955398
cites work: Bottleneck extrema
cites work: The Bottleneck Traveling Salesman Problem
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic
cites work: Q4461911
cites work: Q4461912
cites work: Q4461913
cites work: Q4461917
cites work: An approximation algorithm for a bottleneck traveling salesman problem
cites work: Q5187226
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: A linear time algorithm for the bottleneck biconnected spanning subgraph problem
cites work: Guaranteed performance heuristics for the bottleneck traveling salesman problem
cites work: A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
cites work: A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
cites work: An efficient heuristic algorithm for the bottleneck traveling salesman problem
cites work: On the Flow-Shop Sequencing Problem with No Wait in Process†
cites work: Q4461910
cites work: Algorithms for the minimax problem of the traveling salesman. I: An approach based on dynamic programming
cites work: Algorithms for the minimax problem of the travelling salesman. II: Dual approach
cites work: On Gilmore-Gomory's open question for the bottleneck TSP.
cites work: An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices
DOI: 10.1007/S10732-012-9194-6
description: scientific article; zbMATH DE number 6700353