BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
From MaRDI portal
Publication:839891
DOI10.1007/s11750-009-0083-6zbMath1170.90447OpenAlexW2052550402MaRDI QIDQ839891
Gloria Pérez, María Merino, Laureano Fernando Escudero Bueno, María Araceli Garín
Publication date: 3 September 2009
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-009-0083-6
branch-and-fix coordinationnonanticipativity constraintstwin node familybranch and node selectionmultistage stochastic mixed 0-1 programmingscenario-clustering
Related Items
On the number of stages in multistage stochastic programs, On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming, A parallelised distributed implementation of a branch and fix coordination algorithm, Cluster Lagrangean decomposition in multistage stochastic optimization, Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics, Stochastic forestry planning under market and growth uncertainty, Structuring Bilateral Energy Contract Portfolios in Competitive Markets, BBPH: using progressive hedging within branch and bound to solve multi-stage stochastic mixed integer programs, Risk-averse two-stage stochastic programs in furniture plants, A progressive hedging based branch-and-bound algorithm for mixed-integer stochastic programs, A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems, An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees, On solving strong multistage nonsymmetric stochastic mixed 0-1 problems, Stochastic set packing problem, Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic, Stochastic optimization models in forest planning: a progressive hedging solution approach, On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generating Scenario Trees for Multistage Decision Problems
- Forestry management under uncertainty
- A heuristic procedure for stochastic integer programs with complete recourse
- On a stochastic sequencing and scheduling problem
- A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty
- Scenario tree modeling for multistage stochastic programs
- 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.
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- A stochastic 0-1 program based approach for the air traffic flow management problem
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
- A two-stage planning model for power scheduling in a hydro-thermal system under uncertainty
- Scenario reduction algorithms in stochastic programming
- Computational solution of capacity planning models under uncertainty
- A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
- The million-variable ``march for stochastic combinatorial optimization
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- 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
- A Computational Study of Search Strategies for Mixed Integer Programming
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
- An application of Lagrangian relaxation to a capacity planning problem under uncertainty
- Programming Under Uncertainty: The Equivalent Convex Program
- Benchmarking optimization software with performance profiles.
