Pages that link to "Item:Q3762097"

The following pages link to The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases (Q3762097):

Displaying 21 items.

• GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
• The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game (Q477339) (← links)
• The open capacitated arc routing problem (Q716347) (← links)
• The arc partitioning problem (Q806736) (← links)
• A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal (Q850322) (← links)
• A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
• Approximate solutions for the capacitated arc routing problem (Q1121808) (← links)
• Routeing winter gritting vehicles (Q1317045) (← links)
• Transforming arc routing into node routing problems (Q1820685) (← links)
• A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
• Solvable cases of the \(k\)-person Chinese postman problem (Q1892106) (← links)
• A capacitated general routing problem on mixed networks (Q1894722) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
• Augment-insert algorithms for the capacitated arc routing problem (Q2276892) (← links)
• New lower bound for the capacitated arc routing problem (Q2496046) (← links)
• Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
• Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
• New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
• (Q3216698) (← links)
• Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)