Pages that link to "Item:Q2496039"

The following pages link to Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039):

Displaying 40 items.

• Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
• The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
• Local search heuristics for sectoring routing in a household waste collection context (Q323486) (← 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)
• 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)
• The capacitated general windy routing problem with turn penalties (Q433125) (← links)
• Crossover iterated local search for SDCARP (Q489138) (← 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 variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
• A memetic algorithm for the team orienteering problem (Q972625) (← 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)
• Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
• Heuristic methods for the sectoring arc routing problem (Q1041923) (← links)
• Visual attractiveness in routing problems: a review (Q1634050) (← links)
• An efficiency-based path-scanning heuristic for the capacitated arc routing problem (Q1634089) (← links)
• Efficient local search strategies for the mixed capacitated arc routing problems under time restrictions with intermediate facilities (Q1722978) (← links)
• The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
• Splitting procedures for the mixed capacitated arc routing problem under time restrictions with intermediate facilities (Q1755810) (← links)
• An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
• Heuristic method for a mixed capacitated arc routing problem: A refuse collection application (Q1887872) (← links)
• A guided local search procedure for the multi-compartment capacitated arc routing problem (Q2270452) (← links)
• Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
• Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
• A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
• Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic (Q2673293) (← links)
• A novel model for arc territory design: promoting Eulerian districts (Q2811937) (← links)
• Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
• A Decade of Capacitated Arc Routing (Q3564348) (← links)
• An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances (Q5131730) (← links)
• New large-scale data instances for CARP and new variations of CARP (Q5882245) (← links)
• Combinatorial optimization and green logistics (Q5900891) (← links)
• Combinatorial optimization and green logistics (Q5925286) (← links)
• On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)
• On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
• Solving vehicle routing problems with intermediate stops using VRPSolver models (Q6179690) (← links)
• Fast upper and lower bounds for a large‐scale real‐world arc routing problem (Q6179706) (← links)