Pages that link to "Item:Q688927"

The following pages link to The integer \(L\)-shaped method for stochastic integer programs with complete recourse (Q688927):

Displaying 50 items.

• Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
• Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (Q291063) (← links)
• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
• Satisficing measure approach for vehicle routing problem with time windows under uncertainty (Q320689) (← links)
• Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals (Q323449) (← links)
• Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption (Q336602) (← links)
• Evaluating and optimizing resilience of airport pavement networks (Q336945) (← links)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
• Two-stage stochastic programming supply chain model for biodiesel production via wastewater treatment (Q342004) (← links)
• Stochastic programming analysis and solutions to schedule overcrowded operating rooms in China (Q342461) (← links)
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
• The stop-and-drop problem in nonprofit food distribution networks (Q478060) (← links)
• Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
• Exact algorithms on reliable routing problems under uncertain topology using aggregation techniques for exponentially many scenarios (Q513625) (← links)
• An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays (Q540153) (← links)
• Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports (Q547122) (← links)
• The capacitated vehicle routing problem with stochastic demands and time windows (Q547129) (← links)
• Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning (Q613606) (← links)
• Almost robust discrete optimization (Q666949) (← links)
• Stochastic allocation and scheduling for conditional task graphs in multi-processor systems-on-chip (Q707694) (← links)
• Stochastic set packing problem (Q713096) (← links)
• Operations research challenges in forestry: 33 open problems (Q748549) (← links)
• The stochastic location-assignment problem on a tree (Q816410) (← links)
• B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
• A two-step stochastic approach for operating rooms scheduling in multi-resource environment (Q827107) (← links)
• Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage (Q827111) (← links)
• The stochastic opportunistic replacement problem. III: Improved bounding procedures (Q827144) (← links)
• On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming (Q839882) (← links)
• A generic stochastic model for supply-and-return network design (Q850288) (← links)
• Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation (Q856275) (← links)
• Solving a generalized traveling salesperson problem with stochastic customers (Q868135) (← 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)
• Allocation and scheduling of conditional task graphs (Q969530) (← links)
• Pre-disaster investment decisions for strengthening a highway network (Q976032) (← links)
• The bilevel knapsack problem with stochastic right-hand sides (Q991476) (← links)
• A comparative study of decomposition algorithms for stochastic combinatorial optimization (Q1001189) (← links)
• Modeling supplier selection and the use of option contracts for global supply chain design (Q1017454) (← links)
• Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands (Q1043246) (← links)
• Stochastic vehicle routing (Q1266554) (← links)
• Planning models for freight transportation (Q1278638) (← links)
• A cutting-plane approach to mixed 0-1 stochastic integer programs (Q1278962) (← links)
• L-shaped decomposition of two-stage stochastic programs with integer recourse (Q1290673) (← links)
• On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse. (Q1298755) (← links)
• Dual decomposition in stochastic integer programming (Q1306366) (← links)
• Stochastic programming with simple integer recourse (Q1315421) (← links)