The following pages link to (Q3159349):
Displayed 21 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- On the collaboration uncapacitated arc routing problem (Q342264) (← links)
- A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
- A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← links)
- The shared customer collaboration vehicle routing problem (Q1681166) (← links)
- The generalized arc routing problem (Q1688441) (← links)
- The undirected capacitated general routing problem with profits (Q1752868) (← links)
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
- Analysis of effective sets of routes for the split-delivery periodic inventory routing problem (Q2076819) (← links)
- The min-max close-enough arc routing problem (Q2116901) (← links)
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
- Multi-depot rural postman problems (Q2408522) (← links)
- Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems (Q6062003) (← links)
- On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)