Solvable cases of the \(k\)-person Chinese postman problem
From MaRDI portal
Publication:1892106
DOI10.1016/0167-6377(94)90073-6zbMath0823.90128OpenAlexW2094043080MaRDI QIDQ1892106
Publication date: 6 July 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)90073-6
Related Items
Algorithms for the windy postman problem ⋮ Parameterized complexity of \(k\)-Chinese postman problem ⋮ A novel model for sustainable waste collection arc routing problem: Pareto-based algorithms ⋮ Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties ⋮ Improved approximation algorithms for some min-max postmen cover problems with applications to the min-max subtree cover ⋮ Well-solved cases of the 2-peripatetic salesman problem ⋮ Approximation algorithms for some min-max postmen cover problems ⋮ Approximate solutions for the maximum benefit chinese postman problem ⋮ Min-Max K -vehicles windy rural postman problem ⋮ A metaheuristic for the min-max windy rural postman problem with K vehicles ⋮ A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem ⋮ New facets and an enhanced branch-and-cut for the min-max K -vehicles windy rural postman problem ⋮ Uncertain multi-objective Chinese postman problem
Cites Work
- Unnamed Item
- Unnamed Item
- On the windy postman problem
- A new algorithm for the directed Chinese postman problem
- On the windy postman problem on Eulerian graphs
- Improved solutions for the Chinese postman problem on mixed networks
- Algorithms for the windy postman problem
- Algorithms for the Chinese postman problem on mixed networks
- The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
- The Chinese Postman Problem for Mixed Networks
- The Capacitated Arc Routing Problem: Lower bounds
- On the complexity of edge traversing
- Matching, Euler tours and the Chinese postman
- Networks and vehicle routing for municipal waste collection
