Pages that link to "Item:Q3057121"
From MaRDI portal
The following pages link to Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121):
Displayed 16 items.
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem (Q1707079) (← links)
- The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
- Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity (Q1752846) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- Search games on a network with travelling and search costs (Q2349413) (← links)
- The aircraft maintenance base location problem (Q2356276) (← links)
- Multi-depot rural postman problems (Q2408522) (← links)
- A branch-price-and-cut algorithm for the min-max<i>k</i>-vehicle windy rural postman problem (Q2811322) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
- Search games on networks with travelling and search costs and with arbitrary searcher starting points (Q5326807) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6168929) (← links)