Pages that link to "Item:Q1970425"

The following pages link to An algorithm for the hierarchical Chinese postman problem (Q1970425):

Displaying 22 items.

• Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← 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)
• The target visitation arc routing problem (Q2121609) (← links)
• An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360) (← 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)
• Parameterized Complexity of the k-Arc Chinese Postman Problem (Q2921440) (← links)
• (Q2993661) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• (Q3194237) (← links)
• (Q3346110) (← links)
• Postman tour on a graph with precedence relation on arcs (Q3787808) (← links)
• (Q4025748) (← links)
• Hierarchical Chinese postman problem with fuzzy travel times (Q5084174) (← links)
• An improved heuristic algorithm for the maximum benefit Chinese postman problem (Q5092514) (← links)
• An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances (Q5131730) (← links)
• (Q5271450) (← links)
• Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
• Solving the large-scale min-max \(k\)-rural postman problem for snow plowing (Q6496352) (← links)
• Approximation algorithms for two clustered arc routing problems (Q6645185) (← links)