A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
From MaRDI portal
(Redirected from Publication:293330)
Recommendations
Cites work
- scientific article; zbMATH DE number 4027206 (Why is no real title available?)
- scientific article; zbMATH DE number 3346402 (Why is no real title available?)
- Bottleneck extrema
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
- Halin graphs and the travelling salesman problem
- The Bottleneck Traveling Salesman Problem
Cited in
(6)- Traveling salesman problem under categorization
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
- scientific article; zbMATH DE number 4155883 (Why is no real title available?)
- A survey of very large-scale neighborhood search techniques
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions
- Multiobjective traveling salesperson problem on Halin graphs
This page was built for publication: A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293330)