Pages that link to "Item:Q1628059"
From MaRDI portal
The following pages link to A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (Q1628059):
Displaying 8 items.
- A novel discretization scheme for the close enough traveling salesman problem (Q1652067) (← links)
- Using tornado-related weather data to route unmanned aerial vehicles to locate damage and victims (Q2063081) (← links)
- A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance (Q2147130) (← links)
- Multi-visit drone routing problem (Q2333150) (← links)
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← 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)