Pages that link to "Item:Q4849324"

The following pages link to Arc Routing Problems, Part I: The Chinese Postman Problem (Q4849324):

Displaying 20 items.

• Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs (Q2958236) (← links)
• Searching symmetric networks with Utilitarian-Postman paths (Q3057096) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• Efficient Algorithms for Eulerian Extension (Q3057616) (← links)
• Hide-and-seek games on a tree to which Eulerian networks are attached (Q3184601) (← links)
• Structural Parameterizations of the Mixed Chinese Postman Problem (Q3452829) (← links)
• A Decade of Capacitated Arc Routing (Q3564348) (← links)
• Postman tour on a graph with precedence relation on arcs (Q3787808) (← links)
• The polyhedron of the rural postman problem (Q3983753) (← links)
• Arc Routing Problems, Part II: The Rural Postman Problem (Q4861354) (← links)
• (Q5271451) (← links)
• Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
• Modeling the Pre Auction Stage The Truckload Case (Q5850937) (← links)
• Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918581) (← links)
• Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918727) (← links)
• The Rural Postman Problem on mixed graphs with turn penalties (Q5959378) (← links)
• Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)
• Quantum encoding of dynamic directed graphs (Q6151614) (← links)
• The biobjective minimum-cost perfect matching problem and Chinese postman problem (Q6495384) (← links)
• A heuristic algorithm for the drone rural postman problem (Q6536949) (← links)