Pages that link to "Item:Q3114905"

The following pages link to A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems (Q3114905):

Displaying 50 items.

• Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
• Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
• Optimal design of bilateral contracts for energy procurement (Q319838) (← links)
• A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty (Q322919) (← links)
• Forward thresholds for operation of pumped-storage stations in the real-time energy market (Q323325) (← links)
• Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty (Q336654) (← links)
• Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
• Mixed integer linear programming formulations for probabilistic constraints (Q439901) (← links)
• The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
• Stochastic lot-sizing with backlogging: computational complexity analysis (Q537961) (← links)
• A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach (Q723935) (← links)
• Stochastic optimization models in forest planning: a progressive hedging solution approach (Q748577) (← links)
• Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
• A heuristic procedure for stochastic integer programs with complete recourse (Q819082) (← links)
• On the number of stages in multistage stochastic programs (Q827133) (← 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)
• On a stochastic sequencing and scheduling problem (Q875406) (← links)
• On stochastic lot-sizing problems with random lead times (Q943786) (← links)
• On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty (Q1026569) (← links)
• On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming (Q1040974) (← links)
• Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming (Q1043350) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system (Q1730678) (← links)
• An efficient computational method for large scale surgery scheduling problems with chance constraints (Q1744896) (← links)
• A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems (Q1751680) (← links)
• A stabilised scenario decomposition algorithm applied to stochastic unit commitment problems (Q1753575) (← links)
• Integration of progressive hedging and dual decomposition in stochastic integer programs (Q1785365) (← links)
• Monotonic bounds in multistage mixed-integer stochastic programming (Q1789577) (← links)
• Postoptimality for mean-risk stochastic mixed-integer programs and its application (Q1935908) (← links)
• The stochastic interdiction median problem with disruption intensity levels (Q1945089) (← links)
• Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount (Q1954948) (← links)
• A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
• A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract (Q2023991) (← links)
• Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs (Q2069234) (← links)
• A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs (Q2118082) (← links)
• Scalable branching on dual decomposition of stochastic mixed-integer programming problems (Q2125568) (← links)
• Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements (Q2147012) (← links)
• Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
• On mixing sets arising in chance-constrained programming (Q2429465) (← links)
• On parallelizing dual decomposition in stochastic integer programming (Q2450615) (← links)
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
• Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
• Fix and relax heuristic for a stochastic lot-sizing problem (Q2506172) (← links)
• Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment (Q2957470) (← links)
• Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning (Q2974324) (← links)
• Branch and Price for Chance-Constrained Bin Packing (Q3386782) (← links)
• A branch-and-bound method for multistage stochastic integer programs with risk objectives (Q3498593) (← links)
• A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging (Q3503865) (← links)
• An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem (Q4456094) (← links)