Pages that link to "Item:Q2960368"
From MaRDI portal
The following pages link to A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368):
Displaying 18 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)
- The set orienteering problem (Q1754239) (← links)
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- On the distance-constrained close enough arc routing problem (Q2029943) (← 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)
- Data-driven optimization and statistical modeling to improve meter reading for utility companies (Q2147136) (← links)
- A Markov decision process model on dynamic routing for target surveillance (Q2669763) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- The Mothership and Drone Routing Problem (Q3386760) (← links)
- Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (Q5058005) (← links)
- A Branch-and-Bound Approach to the Traveling Salesman Problem with a Drone (Q5138267) (← links)
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← links)
- A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← 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)
