Pages that link to "Item:Q3635101"

The following pages link to An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands (Q3635101):

Displaying 45 items.

• A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
• Improved approximation algorithms for cumulative VRP with stochastic demands (Q2181250) (← links)
• Scheduled service network design with resource management for two-tier multimodal city logistics (Q2239992) (← links)
• Accelerated sample average approximation method for two-stage stochastic programming with binary first-stage variables (Q2284466) (← links)
• Liner ship bunkering and sailing speed planning with uncertain demand (Q2301031) (← links)
• Robust optimization for the vehicle routing problem with multiple deliverymen (Q2323425) (← links)
• Sustainable multi-depot emergency facilities location-routing problem with uncertain information (Q2335140) (← links)
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
• A solution method for a two-dispatch delivery problem with stochastic customers (Q2369965) (← links)
• The efficacy of exclusive territory assignments to delivery vehicle drivers (Q2383103) (← links)
• On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
• A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
• The million-variable ``march'' for stochastic combinatorial optimization (Q2494291) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands (Q2629676) (← links)
• An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects (Q2654324) (← links)
• Resilient route design for collection of material from suppliers with split deliveries and stochastic demands (Q2676305) (← links)
• Improving the integer L-shaped method (Q2830952) (← links)
• Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints (Q3057127) (← links)
• Exact Algorithms for the Chance-Constrained Vehicle Routing Problem (Q3186494) (← links)
• An Approximation-Based Approach for Chance-Constrained Vehicle Routing and Air Traffic Control Problems (Q3296386) (← links)
• Mitigating Information Asymmetry in Liver Allocation (Q3386759) (← links)
• A selective newsvendor approach to order management (Q3612299) (← links)
• Fuzzy green vehicle routing problem with simultaneous pickup – delivery and time windows (Q4578167) (← links)
• Stochastic Planning and Scheduling with Logic-Based Benders Decomposition (Q5057988) (← links)
• Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events (Q5060797) (← links)
• A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (Q5315817) (← links)
• AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS (Q5405793) (← links)
• A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem (Q5497420) (← links)
• An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers (Q5689143) (← links)
• Periodic supply vessel planning under demand and weather uncertainty (Q5889188) (← links)
• Variable neighborhood search for the stochastic and dynamic vehicle routing problem (Q5963105) (← links)
• A Vehicle Routing Problem with Stochastic Demand (Q5966685) (← links)
• A vehicle routing problem with multiple service agreements (Q6066197) (← links)
• A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique (Q6092593) (← links)
• The Vehicle Routing Problem with Stochastic Demands and Split Deliveries (Q6102745) (← links)
• Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints (Q6106980) (← links)
• Asymmetric probabilistic minimum-cost Hamiltonian cycle problem considering arc and vertex failures (Q6109290) (← 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)
• New exact algorithm for the integrated train timetabling and rolling stock circulation planning problem with stochastic demand (Q6565434) (← links)
• Recourse strategy for the routing problem of mobile parcel lockers with time windows under uncertain demands (Q6565437) (← links)
• Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems (Q6572838) (← links)