Pages that link to "Item:Q2151360"
From MaRDI portal
The following pages link to An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360):
Displaying 14 items.
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game (Q477339) (← links)
- The Chinese deliveryman problem (Q2025136) (← links)
- Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868) (← links)
- Approximating the length of Chinese postman tours (Q2257098) (← links)
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
- Parameterized Complexity of the k-Arc Chinese Postman Problem (Q2921440) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- (Q3194237) (← links)
- (Q3346110) (← links)
- (Q4025748) (← links)
- A 3/2-Approximation Algorithm for the Mixed Postman Problem (Q4699169) (← links)
- An improved heuristic algorithm for the maximum benefit Chinese postman problem (Q5092514) (← links)
- Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)