Pages that link to "Item:Q1342042"

The following pages link to A polyhedral approach to the rural postman problem (Q1342042):

Displaying 33 items.

• A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
• A branch-and-cut algorithm for the orienteering arc routing problem (Q342166) (← links)
• On the collaboration uncapacitated arc routing problem (Q342264) (← links)
• A branch-and-cut algorithm for the maximum benefit Chinese postman problem (Q378087) (← links)
• Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
• Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
• Solving the prize-collecting rural postman problem (Q1041930) (← links)
• New inequalities for the general routing problem (Q1278493) (← links)
• The rural postman problem with deadline classes (Q1291753) (← links)
• The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789) (← links)
• A heuristic algorithm based on Monte Carlo methods for the rural postman problem. (Q1406725) (← links)
• Solving the hierarchical Chinese postman problem as a rural postman problem. (Q1428044) (← links)
• The generalized arc routing problem (Q1688441) (← links)
• The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
• The general routing polyhedron: A unifying framework (Q1806888) (← links)
• A heuristic for the periodic rural postman problem (Q1885936) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• On the distance-constrained close enough arc routing problem (Q2029943) (← links)
• Integer programming formulation and polyhedral results for windy collaborative arc routing problem (Q2146988) (← links)
• Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
• Multi-depot rural postman problems (Q2408522) (← links)
• On the general routing polytope (Q2473035) (← links)
• Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
• A constructive heuristic for the undirected rural postman problem (Q2496045) (← links)
• The directed profitable location rural postman problem (Q2514733) (← links)
• The profitable close-enough arc routing problem (Q2669779) (← links)
• A partitioning column approach for solving LED sorter manipulator path planning problems (Q2673413) (← links)
• The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
• Heuristics for single-pass welding task sequencing (Q4710091) (← links)
• Eulerian location problems (Q4934874) (← links)
• A branch-and-price algorithm for the windy rural postman problem (Q5388154) (← links)
• Improving a constructive heuristic for the general routing problem (Q6179705) (← links)