Pages that link to "Item:Q1428044"
From MaRDI portal
The following pages link to Solving the hierarchical Chinese postman problem as a rural postman problem. (Q1428044):
Displaying 10 items.
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
- The target visitation arc routing problem (Q2121609) (← links)
- A time-dependent hierarchical Chinese postman problem (Q2303339) (← links)
- On the hierarchical Chinese postman problem with linear ordered classes (Q2569095) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Hierarchical Chinese postman problem with fuzzy travel times (Q5084174) (← links)
- An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances (Q5131730) (← links)
- Solving the large-scale min-max \(k\)-rural postman problem for snow plowing (Q6496352) (← links)