Pages that link to "Item:Q2581620"

The following pages link to Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620):

Displaying 39 items.

• 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)
• Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem (Q709128) (← 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)
• Arc routing problems with time-dependent service costs (Q872235) (← links)
• A deterministic tabu search algorithm for the capacitated arc routing problem (Q941537) (← links)
• Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← 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)
• Two phased hybrid local search for the periodic capacitated arc routing problem (Q1694314) (← 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)
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
• Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← 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)
• Exact approaches for the cutting path determination problem (Q2329729) (← links)
• A compact transformation of arc routing problems into node routing problems (Q2341211) (← links)
• An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
• The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• Tour splitting algorithms for vehicle routing problems (Q3114307) (← links)
• Solving the time varying postman problems with timed automata (Q3458818) (← links)
• A Decade of Capacitated Arc Routing (Q3564348) (← links)
• Combinatorial optimization and green logistics (Q5900891) (← links)
• Combinatorial optimization and green logistics (Q5925286) (← links)
• Memetic algorithm based on extension step and statistical filtering for large-scale capacitated arc routing problems (Q6062003) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)