Pages that link to "Item:Q1115814"
From MaRDI portal
The following pages link to A new algorithm for the directed Chinese postman problem (Q1115814):
Displaying 10 items.
- Uncertain multi-objective Chinese postman problem (Q780142) (← links)
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem (Q1261382) (← links)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- Time-constrained Chinese postman problems (Q1886476) (← links)
- Solvable cases of the \(k\)-person Chinese postman problem (Q1892106) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360) (← links)
- (Q4025748) (← links)
- Arc Routing Problems, Part I: The Chinese Postman Problem (Q4849324) (← links)
- (Q5271450) (← links)