Pages that link to "Item:Q3787808"
From MaRDI portal
The following pages link to Postman tour on a graph with precedence relation on arcs (Q3787808):
Displaying 16 items.
- A multi-population cooperative coevolutionary algorithm for multi-objective capacitated arc routing problem (Q506144) (← links)
- Solving the hierarchical Chinese postman problem as a rural postman problem. (Q1428044) (← links)
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- An algorithm for the hierarchical Chinese postman problem (Q1970425) (← links)
- The target visitation arc routing problem (Q2121609) (← links)
- A time-dependent hierarchical Chinese postman problem (Q2303339) (← links)
- On the hierarchical Chinese postman problem with linear ordered classes (Q2569095) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- Eulerian walks in temporal graphs (Q2689257) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- Hierarchical Chinese postman problem with fuzzy travel times (Q5084174) (← links)
- Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
- Euler is standing in line dial-a-ride problems with precedence-constraints (Q5948963) (← links)
- Approximation algorithms for two clustered arc routing problems (Q6645185) (← links)