Pages that link to "Item:Q2811322"
From MaRDI portal
The following pages link to A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (Q2811322):
Displaying 9 items.
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Multi-depot rural postman problems (Q2408522) (← links)
- Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
- New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
- An updated annotated bibliography on arc routing problems (Q6496350) (← links)
- Aesthetic considerations for the min-max \(K\)-windy rural postman problem (Q6496353) (← links)
