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 50 items.

• An algorithm for two-stage stochastic mixed-integer nonlinear convex problems (Q256673) (← links)
• A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
• Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows (Q264330) (← links)
• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
• An arc-exchange decomposition method for multistage dynamic networks with random arc capacities (Q296965) (← links)
• Satisficing measure approach for vehicle routing problem with time windows under uncertainty (Q320689) (← links)
• A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times (Q320872) (← links)
• On-time delivery probabilistic models for the vehicle routing problem with stochastic demands and time windows (Q320889) (← links)
• An integer L-shaped method for the generalized vehicle routing problem with stochastic demands (Q325450) (← links)
• Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
• The vehicle rescheduling problem (Q336901) (← links)
• A two-stage approach to the orienteering problem with stochastic weights (Q336923) (← links)
• Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands (Q337058) (← links)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← 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)
• The capacitated vehicle routing problem with stochastic demands and time windows (Q547129) (← links)
• Integrated supply chain planning under uncertainty using an improved stochastic approach (Q636501) (← links)
• Stochastic set packing problem (Q713096) (← links)
• On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty (Q839843) (← links)
• On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming (Q839882) (← links)
• BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems (Q839891) (← links)
• The vehicle routing problem with demand range (Q867541) (← links)
• On a stochastic sequencing and scheduling problem (Q875406) (← links)
• On the enrouting protocol problem under uncertainty (Q877076) (← links)
• Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (Q934793) (← links)
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands (Q975999) (← links)
• A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems (Q1010269) (← links)
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← links)
• A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
• Stochastic vehicle routing with modified savings algorithm (Q1065710) (← links)
• Models and exact solutions for a class of stochastic location-routing problems (Q1123112) (← links)
• The capacitated vehicle routing problem with evidential demands (Q1642773) (← links)
• Faster rollout search for the vehicle routing problem with stochastic demands and restocking (Q1651700) (← links)
• Vehicle routing with probabilistic capacity constraints (Q1651706) (← links)
• Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands (Q1653371) (← links)
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
• Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry (Q1665815) (← links)
• A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration (Q1711440) (← links)
• The dynamic bowser routing problem (Q1711454) (← links)
• A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty (Q1761157) (← links)
• Exact algorithms for the chance-constrained vehicle routing problem (Q1800993) (← links)
• Short-term liner ship fleet planning with container transshipment and uncertain container shipment demand (Q1926991) (← links)
• Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
• An exact algorithm to solve the vehicle routing problem with stochastic demands under an optimal restocking policy (Q1991276) (← links)
• Self-imposed time windows in vehicle routing problems (Q2018105) (← links)
• Home service routing and appointment scheduling with stochastic service times (Q2028845) (← links)