Pages that link to "Item:Q2570997"
From MaRDI portal
The following pages link to The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997):
Displaying 50 items.
- Cutting planes for the multistage stochastic unit commitment problem (Q291049) (← 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)
- 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)
- 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)
- Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (Q934793) (← 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)
- Cutting plane algorithms for solving a stochastic edge-partition problem (Q1040087) (← links)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
- An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information (Q1634284) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- Stochastic last mile relief network design with resource reallocation (Q1703464) (← links)
- The Benders decomposition algorithm: a literature review (Q1751891) (← links)
- Mathematical programming formulations for approximate simulation of multistage production systems (Q1926696) (← 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)
- 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)
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← links)
- Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector (Q2084032) (← 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)
- An extended formulation for two-stage stochastic unit commitment with reserves (Q2157884) (← 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)
- Scenario-based cuts for structured two-stage stochastic and distributionally robust \(p\)-order conic mixed integer programs (Q2231326) (← links)
- A loose Benders decomposition algorithm for approximating two-stage mixed-integer recourse models (Q2235163) (← links)
- Effects of feasibility cuts in Lagrangian relaxation for a two-stage stochastic facility location and network flow problem (Q2300645) (← links)
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set (Q2312325) (← links)
- A decomposition approach for solving a broadcast domination network design problem (Q2442092) (← 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)
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming (Q2490333) (← links)
- Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach (Q2502202) (← links)
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables (Q2502216) (← 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)
- A Two-Stage Stochastic Integer Programming Approach to Integrated Staffing and Scheduling with Application to Nurse Management (Q2797463) (← links)
- Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints (Q2815438) (← links)
- Improving the Integer L-Shaped Method (Q2830952) (← links)
- Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment (Q2957470) (← links)
- Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty (Q3387962) (← links)
- <i>K</i>-Adaptability in Two-Stage Robust Binary Programming (Q3465590) (← links)
- Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
