Pages that link to "Item:Q3564373"
From MaRDI portal
The following pages link to Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network (Q3564373):
Displaying 20 items.
- A novel discretization scheme for the close enough traveling salesman problem (Q1652067) (← links)
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325) (← links)
- The generalized arc routing problem (Q1688441) (← links)
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
- A matheuristic for the distance-constrained close-enough arc routing problem (Q2001874) (← links)
- On the distance-constrained close enough arc routing problem (Q2029943) (← links)
- Drone-assisted deliveries: new formulations for the flying sidekick traveling salesman problem (Q2037887) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- The min-max close-enough arc routing problem (Q2116901) (← 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)
- Mixed integer formulations for a routing problem with information collection in wireless networks (Q2273919) (← links)
- A Markov decision process model on dynamic routing for target surveillance (Q2669763) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← 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)
- A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
- The generalized close enough traveling salesman problem (Q6113445) (← links)