The following pages link to Districting for Arc Routing (Q2940070):
Displayed 17 items.
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
- Visual attractiveness in routing problems: a review (Q1634050) (← links)
- Integrating territory design and routing problems (Q1647415) (← links)
- A hybrid heuristic for the maximum dispersion problem (Q2028755) (← 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 concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- Approximating the length of Chinese postman tours (Q2257098) (← links)
- Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
- A districting-based heuristic for the coordinated capacitated arc routing problem (Q2273678) (← links)
- Multi-depot rural postman problems (Q2408522) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- A novel model for arc territory design: promoting Eulerian districts (Q2811937) (← links)
- The Capacitated and Economic Districting Problem (Q5106398) (← links)
- A multi‐period multi‐criteria districting problem applied to primary care scheme with gradual assignment (Q6088170) (← links)
- Approximation schemes for districting problems with probabilistic constraints (Q6106979) (← links)
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)