Pages that link to "Item:Q336759"
From MaRDI portal
The following pages link to A redistricting problem applied to meter reading in power distribution networks (Q336759):
Displaying 14 items.
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← links)
- Towards a stochastic programming modeling framework for districting (Q827113) (← links)
- Visual attractiveness in routing problems: a review (Q1634050) (← links)
- Integrating territory design and routing problems (Q1647415) (← links)
- Exact approaches for solving a covering problem with capacitated subtrees (Q1722966) (← links)
- A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization (Q2026965) (← links)
- Simultaneous node and link districting in transportation networks: model, algorithms and railway application (Q2030544) (← links)
- A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution (Q2178337) (← links)
- A novel model for arc territory design: promoting Eulerian districts (Q2811937) (← links)
- Districting for Arc Routing (Q2940070) (← links)
- The Capacitated and Economic Districting Problem (Q5106398) (← links)
- A continuous districting model focusing on intra‐ and inter‐zonal squared distances and its Voronoi‐based heuristic (Q6070495) (← links)
- Approximation schemes for districting problems with probabilistic constraints (Q6106979) (← links)