Pages that link to "Item:Q3730368"

The following pages link to An algorithm for the Rural Postman problem on a directed graph (Q3730368):

Displaying 33 items.

• New results for the directed profitable rural postman problem (Q296876) (← links)
• A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
• On the collaboration uncapacitated arc routing problem (Q342264) (← links)
• An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
• Uncertain multi-objective Chinese postman problem (Q780142) (← links)
• The arc partitioning problem (Q806736) (← links)
• Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
• A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789) (← links)
• A polyhedral approach to the rural postman problem (Q1342042) (← links)
• Modeling and solving several classes of arc routing problems as traveling salesman problems (Q1374032) (← links)
• The generalized arc routing problem (Q1688441) (← links)
• The windy rural postman problem with a time-dependent zigzag option (Q1751757) (← links)
• Multi-vehicle synchronized arc routing problem to restore post-disaster network connectivity (Q1752846) (← links)
• A computational study of several heuristics for the DRPP (Q1804375) (← links)
• Transforming arc routing into node routing problems (Q1820685) (← links)
• Algorithms for the rural postman problem (Q1906937) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• A new view on rural postman based on Eulerian extension and matching (Q1932348) (← links)
• A two-stage solution approach for the directed rural postman problem with turn penalties (Q1991193) (← links)
• The target visitation arc routing problem (Q2121609) (← links)
• Integer programming formulation and polyhedral results for windy collaborative arc routing problem (Q2146988) (← links)
• New heuristic algorithms for the windy rural postman problem (Q2387296) (← links)
• Multi-depot rural postman problems (Q2408522) (← links)
• Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
• A note on the undirected rural postman problem polytope (Q2492671) (← links)
• Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
• The directed profitable location rural postman problem (Q2514733) (← links)
• A partitioning column approach for solving LED sorter manipulator path planning problems (Q2673413) (← links)
• Solving the close-enough arc routing problem (Q2811327) (← links)
• Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
• A branch &amp; cut algorithm for the windy general routing problem and special cases (Q5295483) (← links)
• A branch-and-price algorithm for the windy rural postman problem (Q5388154) (← links)