The following pages link to (Q4025748):
Displaying 7 items.
- Developing the branch and bound method in the problem of searching for the optimal cyclic route (cyclic rural postman problem) (Q465989) (← links)
- A new algorithm for the directed Chinese postman problem (Q1115814) (← links)
- An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360) (← links)
- Approximating the length of Chinese postman tours (Q2257098) (← links)
- (Q3346110) (← links)
- (Q4399158) (← links)
- (Q5271450) (← links)