Pages that link to "Item:Q3113511"
From MaRDI portal
The following pages link to New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511):
Displayed 7 items.
- A matheuristic for the team orienteering arc routing problem (Q319589) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
- The collaborative consistent vehicle routing problem with workload balance (Q2030339) (← links)
- Multi-depot rural postman problems (Q2408522) (← links)
- A multiperiod drayage problem with customer-dependent service periods (Q2668610) (← links)
- A branch-price-and-cut algorithm for the min-max<i>k</i>-vehicle windy rural postman problem (Q2811322) (← links)