Pages that link to "Item:Q5245372"

The following pages link to Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs (Q5245372):

Displaying 29 items.

• The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming (Q507318) (← links)
• A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse (Q598605) (← links)
• L-shaped decomposition of two-stage stochastic programs with integer recourse (Q1290673) (← links)
• Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
• Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
• A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
• Higher-order total variation bounds for expectations of periodic functions and simple integer recourse approximations (Q1989720) (← links)
• A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
• On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems (Q2091214) (← links)
• A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs (Q2097655) (← links)
• An L-shaped method with strengthened lift-and-project cuts (Q2109005) (← links)
• About the complexity of two-stage stochastic IPs (Q2118129) (← links)
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
• Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk (Q2189450) (← links)
• A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models (Q2235163) (← 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)
• Partition-based decomposition algorithms for two-stage stochastic integer programs with continuous recourse (Q2288987) (← links)
• (Q2762573) (← links)
• Improving the integer L-shaped method (Q2830952) (← 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)
• About the Complexity of Two-Stage Stochastic IPs (Q5041750) (← links)
• On Generating Lagrangian Cuts for Two-Stage Stochastic Integer Programs (Q5106425) (← links)
• A Stochastic Integer Programming Approach to Air Traffic Scheduling and Operations (Q5144771) (← links)
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs (Q5219296) (← links)
• Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)
• A solution algorithm for chance-constrained problems with integer second-stage recourse decisions (Q6126651) (← links)
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)