A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
From MaRDI portal
Publication:1010269
DOI10.1016/j.cor.2008.11.011zbMath1179.90245OpenAlexW2055551920MaRDI QIDQ1010269
Gloria Pérez, María Araceli Garín, María Merino, Laureano Fernando Escudero Bueno
Publication date: 3 April 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.011
Benders decompositionbranch-and-fix coordinationnonanticipativity constraintssplitting variablestwin node familytwo-stage stochastic integer programming
Related Items
On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming, BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems, A parallelised distributed implementation of a branch and fix coordination algorithm, Humanitarian logistics network design under mixed uncertainty, Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization, Two-stage stochastic programming supply chain model for biodiesel production via wastewater treatment, Cluster Lagrangean decomposition in multistage stochastic optimization, Stochastic multi-site capacity planning of TFT-LCD manufacturing using expected shadow-price based decomposition, A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems, Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems, A new optimal electricity market bid model solved through perspective cuts, On air traffic flow management with rerouting. II: Stochastic case, Structuring Bilateral Energy Contract Portfolios in Competitive Markets, The stochastic capacitated branch restructuring problem, Stochastic set packing problem, Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic, On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming, An algorithm for two-stage stochastic mixed-integer nonlinear convex problems
Cites Work
- Unnamed Item
- Unnamed Item
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- Partitioning procedures for solving mixed-variables programming problems
- Stochastic integer programming: general models and algorithms
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Dual decomposition in stochastic integer programming
- Stochastic programming with integer variables
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- The million-variable ``march for stochastic combinatorial optimization
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Introduction to Stochastic Programming
- Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
- Programming Under Uncertainty: The Equivalent Convex Program
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Benchmarking optimization software with performance profiles.
