Solving the hierarchical Chinese postman problem as a rural postman problem.
From MaRDI portal
(Redirected from Publication:1428044)
Recommendations
- An algorithm for the hierarchical Chinese postman problem
- On the hierarchical Chinese postman problem with linear ordered classes
- scientific article; zbMATH DE number 6741960
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- Algorithms for the rural postman problem
Cites work
- A branch-and-cut algorithm for the undirected rural postman problem
- A polyhedral approach to the rural postman problem
- An algorithm for the hierarchical Chinese postman problem
- Improvement Procedures for the Undirected Rural Postman Problem
- Postman tour on a graph with precedence relation on arcs
- Routeing winter gritting vehicles
Cited in
(13)- An algorithm for the hierarchical Chinese postman problem
- scientific article; zbMATH DE number 6612248 (Why is no real title available?)
- A time-dependent hierarchical Chinese postman problem
- The target visitation arc routing problem
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
- Arc Routing Problems, Part I: The Chinese Postman Problem
- A new view on rural postman based on Eulerian extension and matching
- On the hierarchical Chinese postman problem with linear ordered classes
- An open-source desktop application for generating arc-routing benchmark instances
- Hierarchical Chinese postman problem with fuzzy travel times
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
- Recent results on arc routing problems: an annotated bibliography
- Solving the large-scale min-max \(k\)-rural postman problem for snow plowing
This page was built for publication: Solving the hierarchical Chinese postman problem as a rural postman problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428044)