On the hierarchical Chinese postman problem with linear ordered classes

DOI10.1016/j.ejor.2004.06.003zbMath1077.90055OpenAlexW2112026633MaRDI QIDQ2569095

Ton Volgenant, Peter Korteweg

Publication date: 17 October 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.06.003

zbMATH Keywords

matchingroutingChinese postman problempost-optimalitylexicographic objective

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (8)

The target visitation arc routing problem ⋮ The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable ⋮ The hierarchical traveling salesman problem ⋮ 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

Cites Work

• Unnamed Item
• The rural postman problem with deadline classes
• Lexicographic bottleneck combinatorial problems
• Solving the hierarchical Chinese postman problem as a rural postman problem.
• An algorithm for the hierarchical Chinese postman problem
• An analysis of alternative strategies for implementing matching algorithms
• Postman tour on a graph with precedence relation on arcs
• On general routing problems
• A fundamental problem in vehicle routing
• Arc Routing Problems, Part I: The Chinese Postman Problem
• Arc Routing Problems, Part II: The Rural Postman Problem

This page was built for publication: On the hierarchical Chinese postman problem with linear ordered classes