Pages that link to "Item:Q2387296"
From MaRDI portal
The following pages link to New heuristic algorithms for the windy rural postman problem (Q2387296):
Displaying 14 items.
- On the windy postman problem (Q800837) (← links)
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows (Q1651548) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- OAR lib: an open source arc routing library (Q2293658) (← links)
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
- A branch-price-and-cut algorithm for the min-max \(k\)-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)
- A branch-and-price algorithm for the windy rural postman problem (Q5388154) (← links)
- Plowing with precedence in polynomial time (Q6092637) (← links)
- The single robot line coverage problem: Theory, algorithms, and experiments (Q6180033) (← links)
- Aesthetic considerations for the min-max \(K\)-windy rural postman problem (Q6496353) (← links)
