Pages that link to "Item:Q4319767"

The following pages link to A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs (Q4319767):

Displaying 28 items.

• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• Fitness landscape analysis and metaheuristics efficiency (Q367228) (← links)
• The capacitated general windy routing problem with turn penalties (Q433125) (← links)
• A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times (Q552221) (← links)
• Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• A mixed constrained (identical) vehicle routing problem for time minimisation (Q998682) (← links)
• A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
• A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
• Optimization of printed circuit board manufacturing: Integrated modeling and algorithms (Q1577779) (← links)
• A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
• Routing problems: A bibliography (Q1908308) (← links)
• Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
• A branch and bound algorithm for dynamic resource allocation in population disease management (Q2294385) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
• Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
• Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs (Q2494811) (← links)
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach (Q2514731) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
• A new ILP-based refinement heuristic for vehicle routing problems (Q2583137) (← links)
• Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem (Q2820103) (← links)
• Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
• The Vehicle Routing Problem with Release and Due Dates (Q5131700) (← links)