Pages that link to "Item:Q1870825"

The following pages link to A cutting plane algorithm for the capacitated arc routing problem (Q1870825):

Displaying 41 items.

• Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
• An approach to the asymmetric multi-depot capacitated arc routing problem (Q319291) (← links)
• Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
• 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)
• Local search for the undirected capacitated arc routing problem with profits (Q531469) (← links)
• The open capacitated arc routing problem (Q716347) (← 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)
• A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
• The undirected capacitated arc routing problem with profits (Q975994) (← links)
• An improved heuristic for the capacitated arc routing problem (Q1010273) (← 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)
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← links)
• Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration (Q1046714) (← links)
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
• Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
• The undirected capacitated general routing problem with profits (Q1752868) (← links)
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
• Capacitated arc routing problem with deadheading demands (Q1761173) (← links)
• Evolutionary algorithms for periodic arc routing problems (Q1772855) (← links)
• A guided local search heuristic for the capacitated arc routing problem (Q1873009) (← links)
• Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
• Arc routing for parking enforcement officers: exact and heuristic solutions (Q2077993) (← links)
• Divide-and-conquer large scale capacitated arc routing problems with route cutting off decomposition (Q2123554) (← links)
• Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
• A genetic algorithm for a bi-objective capacitated arc routing problem (Q2496047) (← links)
• A scatter search for the periodic capacitated arc routing problem (Q2570158) (← links)
• Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands (Q2668800) (← links)
• Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem (Q2806992) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• Tour splitting algorithms for vehicle routing problems (Q3114307) (← links)
• A Decade of Capacitated Arc Routing (Q3564348) (← links)
• Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems (Q6062003) (← links)
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)
• A parameterized lower bounding method for the open capacitated arc routing problem (Q6491347) (← links)