The following pages link to (Q4085470):
Displaying 7 items.
- A graph-theoretical approach to a plotter pen touring problem (Q1162175) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees (Q1577774) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Matching, Euler tours and the Chinese postman (Q4766817) (← links)
- Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)
