Pages that link to "Item:Q2490333"

The following pages link to Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333):

Displaying 50 items.

• An algorithm for two-stage stochastic mixed-integer nonlinear convex problems (Q256673) (← links)
• A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
• Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← links)
• Optimizing designs and operations of a single network or multiple interdependent infrastructures under stochastic arc disruption (Q336602) (← 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 multi-site capacity planning of TFT-LCD manufacturing using expected shadow-price based decomposition (Q345460) (← links)
• A computational study of the cutting plane tree algorithm for general mixed-integer linear programs (Q433830) (← 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)
• Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
• Stochastic set packing problem (Q713096) (← links)
• On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming (Q839882) (← links)
• A decomposition-based solution method for stochastic mixed integer nonlinear programs (Q882650) (← links)
• Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (Q934793) (← links)
• Pre-disaster investment decisions for strengthening a highway network (Q976032) (← links)
• A comparative study of decomposition algorithms for stochastic combinatorial optimization (Q1001189) (← links)
• A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems (Q1010269) (← 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)
• A cutting-plane approach to mixed 0-1 stochastic integer programs (Q1278962) (← links)
• Combining Benders decomposition and column generation for multi-activity tour scheduling (Q1652589) (← links)
• Two-stage stochastic, large-scale optimization of a decentralized energy system: a case study focusing on solar PV, heat pumps and storage in a residential quarter (Q1703468) (← links)
• The Benders decomposition algorithm: a literature review (Q1751891) (← links)
• Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
• A new cross decomposition method for stochastic mixed-integer linear programming (Q1752218) (← links)
• A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty (Q1761157) (← links)
• Monotonic bounds in multistage mixed-integer stochastic programming (Q1789577) (← links)
• Decomposition strategy for the stochastic pooling problem (Q1928271) (← links)
• Fenchel decomposition for stochastic mixed-integer programming (Q1937960) (← links)
• Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems (Q1939073) (← links)
• Totally unimodular stochastic programs (Q1949257) (← links)
• Convex approximations for a class of mixed-integer recourse models (Q1958624) (← links)
• A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs (Q1989733) (← links)
• A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← links)
• Robust multi-product newsvendor model with uncertain demand and substitution (Q2030518) (← links)
• A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← 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)
• 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)
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q2164683) (← links)
• Quantitative stability of fully random two-stage stochastic programs with mixed-integer recourse (Q2191294) (← links)
• Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
• Quasi-Monte Carlo methods for two-stage stochastic mixed-integer programs (Q2235151) (← 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)
• Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem (Q2300645) (← links)
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← 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)