Pages that link to "Item:Q1752763"

The following pages link to The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763):

Displaying 13 items.

• A polyhedral approach to the rural postman problem (Q1342042) (← links)
• Solving the hierarchical Chinese postman problem as a rural postman problem. (Q1428044) (← links)
• The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
• The directed profitable rural postman problem with incompatibility constraints (Q1753601) (← links)
• The target visitation arc routing problem (Q2121609) (← links)
• A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (Q2811322) (← links)
• New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
• Hierarchical Chinese postman problem with fuzzy travel times (Q5084174) (← links)
• Variants of the mixed postman problem solvable using linear programming (Q5248773) (← links)
• The Rural Postman Problem on mixed graphs with turn penalties (Q5959378) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)
• Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem (Q6635813) (← links)
• Approximation algorithms for two clustered arc routing problems (Q6645185) (← links)