Pages that link to "Item:Q1863886"
From MaRDI portal
The following pages link to A heuristic algorithm for the mixed Chinese postman problem (Q1863886):
Displaying 15 items.
- Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
- Uncertain multi-objective Chinese postman problem (Q780142) (← links)
- Improved solutions for the Chinese postman problem on mixed networks (Q1304518) (← links)
- On the mixed Chinese postman problem (Q1319678) (← links)
- Finding postal carrier walk paths in mixed graphs (Q1380723) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- Algorithms for the Chinese postman problem on mixed networks (Q1894723) (← links)
- Heuristics for the mixed rural postman problem (Q1968592) (← links)
- An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360) (← links)
- OAR lib: an open source arc routing library (Q2293658) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- (Q3194237) (← links)
- (Q4025748) (← links)
- An optimal algorithm for the mixed Chinese postman problem (Q4887738) (← links)
- An improved heuristic algorithm for the maximum benefit Chinese postman problem (Q5092514) (← links)