Pages that link to "Item:Q1942278"

The following pages link to Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278):

Displaying 13 items.

• Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
• A hybrid metaheuristic approach for the capacitated arc routing problem (Q323105) (← links)
• Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
• Constructive heuristics for the mixed capacity arc routing problem under time restrictions with intermediate facilities (Q342292) (← links)
• Crossover iterated local search for SDCARP (Q489138) (← links)
• Lane covering with partner bounds in collaborative truckload transportation procurement (Q1652017) (← links)
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
• A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
• Robust drone selective routing in humanitarian transportation network assessment (Q2083969) (← links)
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition (Q2123554) (← links)
• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)