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 41 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)
• A lower bound for the node, edge, and arc routing problem (Q340291) (← 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)
• New upper bounds for the multi-depot capacitated arc routing problem (Q537994) (← links)
• The open capacitated arc routing problem (Q716347) (← links)
• A parallel insert method for the capacitated arc routing problem (Q794931) (← links)
• An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems (Q841604) (← links)
• A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
• Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
• Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
• The capacitated arc routing problem: Valid inequalities and facets (Q1384095) (← 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)
• A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
• Lower-bounding and heuristic methods for a refuse collection vehicle routing problem (Q1969871) (← 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)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• Lower and upper bounds for location-arc routing problems with vehicle capacity constraints (Q2253416) (← links)
• A districting-based heuristic for the coordinated capacitated arc routing problem (Q2273678) (← links)
• Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← 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)
• The commodity-split multi-compartment capacitated arc routing problem (Q2664322) (← links)
• The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
• Exact methods based on node-routing formulations for undirected arc-routing problems (Q3376660) (← links)
• New lower bounds for the Capacitated Arc Routing Problem (Q3802908) (← links)
• NODE DUPLICATION LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM (Q4015406) (← links)
• The Capacitated Arc Routing Problem: Lower bounds (Q4022732) (← links)
• A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem (Q4411206) (← links)
• An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand (Q5301129) (← links)
• Efficient algorithms under dynamic graphs to solve the Capacitated Arc Routing Problem with feasible sparse graph (Q5380984) (← links)
• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
• Effects of update frequencies in a dynamic capacitated arc routing problem (Q6092644) (← links)
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)
• An updated annotated bibliography on arc routing problems (Q6496350) (← links)