Pages that link to "Item:Q3328310"
From MaRDI portal
The following pages link to An Algorithm for the Bottleneck Traveling Salesman Problem (Q3328310):
Displaying 15 items.
- 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)
- An approximation algorithm for a bottleneck traveling salesman problem (Q1026245) (← links)
- Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem (Q1079133) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
- Efficiently solvable special cases of bottleneck travelling salesman problems (Q1179263) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- An \(O(n)\) algorithm to solve the Bottleneck Traveling Salesman Problem restricted to ordered product matrices (Q1314323) (← links)
- On Gilmore-Gomory's open question for the bottleneck TSP. (Q1412716) (← links)
- A data-guided lexisearch algorithm for the bottleneck travelling salesman problem (Q1758845) (← links)
- An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
- (Q3772248) (← links)
- (Q5377934) (← links)
- Selection and sequencing heuristics to reduce variance in gas turbine engine nozzle assemblies (Q5939582) (← links)