Pages that link to "Item:Q1290168"

The following pages link to New optimality cuts for a single-vehicle stochastic routing problem (Q1290168):

Displaying 24 items.

• An integer L-shaped method for the generalized vehicle routing problem with stochastic demands (Q325450) (← links)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
• Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage (Q827111) (← links)
• On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands (Q1013973) (← links)
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
• Faster rollout search for the vehicle routing problem with stochastic demands and restocking (Q1651700) (← links)
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
• A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (Q1711440) (← links)
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (Q1991276) (← links)
• Home service routing and appointment scheduling with stochastic service times (Q2028845) (← links)
• Optimal a priori tour and restocking policy for the single-vehicle routing problem with stochastic demands (Q2183324) (← links)
• Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
• A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands (Q2467454) (← links)
• Solving the vehicle routing problem with stochastic demands using the cross-entropy method (Q2485932) (← links)
• Offline approximate value iteration for dynamic solutions to the multivehicle routing problem with stochastic demand (Q2676279) (← links)
• A stochastic inventory routing problem for infectious medical waste collection (Q2811325) (← links)
• Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price (Q2958618) (← links)
• AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (Q5315817) (← 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)