Pages that link to "Item:Q4159199"
From MaRDI portal
The following pages link to The Bottleneck Traveling Salesman Problem (Q4159199):
Displaying 15 items.
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph (Q293330) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- Guaranteed performance heuristics for the bottleneck traveling salesman problem (Q786658) (← links)
- Probabilistic analysis of combinatorial algorithms: A bibliography with selected annotations (Q1162147) (← links)
- Solving the Euclidean bottleneck biconnected edge subgraph problem by 2- relative neighborhood graphs (Q1199461) (← links)
- Traveling salesman problem under categorization (Q1200771) (← links)
- The Guilty net for the traveling salesman problem (Q1200821) (← links)
- An approach for solving a class of transportation scheduling problems (Q1251987) (← links)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
- Neural methods for the traveling salesman problem: Insights from operations research (Q1345270) (← links)
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem (Q1847357) (← links)
- A fast algorithm for a class of bottleneck problems (Q1916054) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- The traveling salesman problem: new polynomial approximation algorithms and domination analysis (Q2780838) (← links)