Pages that link to "Item:Q1411621"

The following pages link to On the capacitated vehicle routing problem (Q1411621):

Displaying 50 items.

• Branch-and-cut algorithms for the split delivery vehicle routing problem (Q296858) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• Multi-period vehicle routing problem with due dates (Q337604) (← links)
• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem (Q342059) (← links)
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem (Q375997) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
• A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
• Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
• Deterministic optimizational problems of transportation logistics (Q612223) (← links)
• A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
• A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows (Q858260) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
• A decision support system for a real vehicle routing problem. (Q1420384) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• A two-phase solution algorithm for the flexible periodic vehicle routing problem (Q1654343) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• New exact solution approaches for the split delivery vehicle routing problem (Q1742903) (← links)
• The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
• On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• The demand weighted vehicle routing problem (Q1754023) (← links)
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
• A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
• Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647) (← links)
• Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
• Encoding binary arithmetic operations in integer programming formulations (Q2016465) (← links)
• New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot (Q2152010) (← links)
• The pyramidal capacitated vehicle routing problem (Q2270294) (← links)
• A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
• A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2327675) (← links)
• A compact transformation of arc routing problems into node routing problems (Q2341211) (← links)
• A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
• An optimization algorithm for the inventory routing problem with continuous moves (Q2468483) (← links)
• Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
• Creating very large scale neighborhoods out of smaller ones by compounding moves (Q2491337) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
• A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts (Q2669559) (← links)
• A new approach on auxiliary vehicle assignment in capacitated location routing problem (Q2795191) (← links)
• Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem (Q3458834) (← links)
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)
• Three algorithms for graph locally harmonious colouring (Q4978237) (← links)
• Formulations for an inventory routing problem (Q4979996) (← links)
• A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants (Q4995082) (← links)