An algorithm for the hierarchical Chinese postman problem

DOI10.1016/S0167-6377(99)00046-2zbMath0968.90065MaRDI QIDQ1970425

Gennaro Improta, Gianpaolo Ghiani

Publication date: 12 December 2000

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

hierarchical Chinese postman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

The target visitation arc routing problem ⋮ The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable ⋮ An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances ⋮ Solving the hierarchical Chinese postman problem as a rural postman problem. ⋮ Hierarchical Chinese postman problem with fuzzy travel times ⋮ The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm ⋮ Approximate solutions for the maximum benefit chinese postman problem ⋮ 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

• Unnamed Item
• Unnamed Item
• Postman tour on a graph with precedence relation on arcs
• Matching, Euler tours and the Chinese postman
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem

This page was built for publication: An algorithm for the hierarchical Chinese postman problem