Pages that link to "Item:Q1010273"

The following pages link to An improved heuristic for the capacitated arc routing problem (Q1010273):

Displaying 10 items.

• GRASP with evolutionary path-relinking for the capacitated arc routing problem (Q336740) (← links)
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (Q342292) (← links)
• Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
• Crossover iterated local search for SDCARP (Q489138) (← links)
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
• The open capacitated arc routing problem (Q716347) (← links)
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
• Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems (Q6062003) (← links)
• A parameterized lower bounding method for the open capacitated arc routing problem (Q6491347) (← links)