Solving the hierarchical Chinese postman problem as a rural postman problem.
From MaRDI portal
Publication:1428044
DOI10.1016/S0377-2217(02)00813-5zbMath1043.90074MaRDI QIDQ1428044
Edgar Alberto Cabral, Gianpaolo Ghiani, Gilbert Laporte, Michel Gendreau
Publication date: 14 March 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
The target visitation arc routing problem, The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable, A new view on rural postman based on Eulerian extension and matching, An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances, Hierarchical Chinese postman problem with fuzzy travel times, The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm, Recent results on Arc Routing Problems: An annotated bibliography, A time-dependent hierarchical Chinese postman problem, On the hierarchical Chinese postman problem with linear ordered classes
Cites Work
- Routeing winter gritting vehicles
- A polyhedral approach to the rural postman problem
- A branch-and-cut algorithm for the undirected rural postman problem
- An algorithm for the hierarchical Chinese postman problem
- Postman tour on a graph with precedence relation on arcs
- Improvement Procedures for the Undirected Rural Postman Problem
