Postman tour on a graph with precedence relation on arcs
From MaRDI portal
Publication:3787808
DOI10.1002/net.3230170304zbMath0644.90090OpenAlexW2080994240MaRDI QIDQ3787808
Pierre Trudeau, Moshe Dror, Jelman I. Stern
Publication date: 1987
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230170304
NP-completeprecedence relationminimum lengthChinese Postmanfeasible postman tourpolynomial complexity solution
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)
Related Items (15)
The target visitation arc routing problem ⋮ Routing problems: A bibliography ⋮ The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable ⋮ Eulerian walks in temporal graphs ⋮ Solving the hierarchical Chinese postman problem as a rural postman problem. ⋮ An algorithm for the hierarchical Chinese postman problem ⋮ A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem ⋮ A Decade of Capacitated Arc Routing ⋮ 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 ⋮ Euler is standing in line dial-a-ride problems with precedence-constraints ⋮ 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
This page was built for publication: Postman tour on a graph with precedence relation on arcs
