The Bottleneck Traveling Salesman Problem
From MaRDI portal
Publication:4159199
Cited in
(19)- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs
- Traveling salesman problem under categorization
- The Guilty net for the traveling salesman problem
- An approach for solving a class of transportation scheduling problems
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem
- Neural methods for the traveling salesman problem: Insights from operations research
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem
- A fast algorithm for a class of bottleneck problems
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- The traveling salesman problem: new polynomial approximation algorithms and domination analysis
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis
- Experimental analysis of heuristics for the bottleneck traveling salesman problem
- A comprehensive survey on the generalized traveling salesman problem
- A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
- Ordered median traveling salesman problem
- The non-disjoint clustered traveling salesperson problem
- Guaranteed performance heuristics for the bottleneck traveling salesman problem
This page was built for publication: The Bottleneck Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4159199)