Pages that link to "Item:Q3100464"

The following pages link to Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse (Q3100464):

Displaying 26 items.

• Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
• The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
• Stochastic and risk management models and solution algorithm for natural gas transmission network expansion and LNG terminal location planning (Q613606) (← links)
• Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (Q934793) (← links)
• Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty (Q1713736) (← links)
• An improved L-shaped method for solving process flexibility design problems (Q1793161) (← links)
• Totally unimodular stochastic programs (Q1949257) (← links)
• Underground mine scheduling under uncertainty (Q2031110) (← links)
• Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector (Q2084032) (← links)
• Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
• A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables (Q2274882) (← links)
• On solving two-stage distributionally robust disjunctive programs with a general ambiguity set (Q2312325) (← links)
• Multicut Benders decomposition algorithm for process supply chain planning under uncertainty (Q2442082) (← links)
• A decomposition approach to the two-stage stochastic unit commitment problem (Q2442096) (← links)
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
• An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects (Q2654324) (← links)
• Integer set reduction for stochastic mixed-integer programming (Q2701423) (← links)
• Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints (Q2815438) (← links)
• Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty (Q3387962) (← links)
• Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs (Q4586174) (← links)
• Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs (Q4609472) (← links)
• Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty (Q5085475) (← links)
• Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
• A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
• A Convex Approximation for Two-Stage Mixed-Integer Recourse Models with a Uniform Error Bound (Q5743615) (← links)
• On greedy approximation algorithms for a class of two-stage stochastic assignment problems (Q5746684) (← links)