Pages that link to "Item:Q1119487"
From MaRDI portal
The following pages link to On the windy postman problem on Eulerian graphs (Q1119487):
Displaying 17 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 cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- Algorithms for the windy postman problem (Q1332802) (← links)
- Solvable cases of the \(k\)-person Chinese postman problem (Q1892106) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Postman problems on series-parallel mixed graphs (Q2183202) (← links)
- OAR lib: an open source arc routing library (Q2293658) (← links)
- New heuristic algorithms for the windy rural postman problem (Q2387296) (← links)
- New results on the windy postman problem (Q2429464) (← links)
- Series-parallel graphs are windy postman perfect (Q2476276) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Approximation Algorithms for the Single Robot Line Coverage Problem (Q3382005) (← 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)