Pages that link to "Item:Q5148188"
From MaRDI portal
The following pages link to An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188):
Displayed 5 items.
- A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance (Q2147130) (← links)
- Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759) (← links)
- The generalized close enough traveling salesman problem (Q6113445) (← links)