Pages that link to "Item:Q337090"

The following pages link to A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090):

Displaying 19 items.

• On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows (Q320889) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• The capacitated vehicle routing problem with evidential demands (Q1642773) (← links)
• An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen (Q1652283) (← links)
• A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
• Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (Q1991276) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• Research on the vehicle routing problem with interval demands (Q2295076) (← links)
• Robust optimization for the vehicle routing problem with multiple deliverymen (Q2323425) (← links)
• A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations (Q2664431) (← links)
• Scheduling interrelated activities in complex projects under high-order rework: a DSM-based approach (Q2668674) (← links)
• An exact solution approach for the inventory routing problem with time windows (Q2669489) (← links)
• Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand (Q2676279) (← links)
• Exact Algorithms for the Chance-Constrained Vehicle Routing Problem (Q3186494) (← links)
• The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands (Q6161273) (← links)
• An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup (Q6164581) (← links)
• An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)