Pages that link to "Item:Q3439977"
From MaRDI portal
The following pages link to Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem (Q3439977):
Displayed 14 items.
- A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (Q1628059) (← links)
- A novel discretization scheme for the close enough traveling salesman problem (Q1652067) (← links)
- A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands (Q1754370) (← links)
- On the distance-constrained close enough arc routing problem (Q2029943) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- Data-driven optimization and statistical modeling to improve meter reading for utility companies (Q2147136) (← links)
- The profitable close-enough arc routing problem (Q2669779) (← links)
- Solving the close-enough arc routing problem (Q2811327) (← links)
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
- Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network (Q3564373) (← links)
- The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) (← links)
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← 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)
