Pages that link to "Item:Q2106868"
From MaRDI portal
The following pages link to Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868):
Displaying 9 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)
- An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360) (← links)
- Approximating the length of Chinese postman tours (Q2257098) (← links)
- Parameterized Complexity of the k-Arc Chinese Postman Problem (Q2921440) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← 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)