The Chinese Postman Problem for Mixed Networks
From MaRDI portal
Cited in
(26)- Asymmetric distances, semidirected networks and majority in Fermat-Weber problems
- The fleet size and mix problem for capacitated arc routing
- A new algorithm for the directed Chinese postman problem
- On the windy postman problem on Eulerian graphs
- Algorithms for the windy postman problem
- Solvable cases of the \(k\)-person Chinese postman problem
- A capacitated general routing problem on mixed networks
- Algorithms for the Chinese postman problem on mixed networks
- Routing problems: A bibliography
- Postman problems on series-parallel mixed graphs
- New heuristic algorithms for the windy rural postman problem
- New results on the windy postman problem
- Series-parallel graphs are windy postman perfect
- Solution of real-world postman problems
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems
- Parameterized complexity of the k-arc Chinese postman problem
- A decade of capacitated arc routing
- A branch-and-price algorithm for the windy rural postman problem
- Arc routing problems: A review of the past, present, and future
- Plowing with precedence in polynomial time
- Time-dependent windy rural postman problem: mathematical formulation and adaptive metaheuristic
- On the windy k-traveling salesman problem
- Minimum cost nowhere-zero flows and cut-balanced orientations
- On the windy postman problem
- Lower bounds and heuristics for the windy rural postman problem
- A metaheuristic for the min-max windy rural postman problem with K vehicles
This page was built for publication: The Chinese Postman Problem for Mixed Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3858019)
