Pages that link to "Item:Q1652067"
From MaRDI portal
The following pages link to A novel discretization scheme for the close enough traveling salesman problem (Q1652067):
Displaying 15 items.
- A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (Q1628059) (← links)
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325) (← links)
- Same-day delivery with pickup stations and autonomous vehicles (Q2003409) (← links)
- On the distance-constrained close enough arc routing problem (Q2029943) (← links)
- A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
- Using tornado-related weather data to route unmanned aerial vehicles to locate damage and victims (Q2063081) (← 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)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← links)
- Facility location problems on graphs with non-convex neighborhoods (Q6047916) (← links)
- On hub location problems in geographically flexible networks (Q6071054) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← 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)
