Pages that link to "Item:Q2661637"
From MaRDI portal
The following pages link to The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637):
Displaying 3 items.
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q6353246) (← links)
- Approximation algorithms for two clustered arc routing problems (Q6645185) (← links)