On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming

DOI10.1016/j.cor.2009.06.023zbMath1176.90422OpenAlexW1966306904MaRDI QIDQ1040974

María Araceli Garín, María Merino, Gloria Pérez, Laureano Fernando Escudero Bueno

Publication date: 27 November 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.06.023

zbMATH Keywords

branch-and-fix coordinationnonanticipativity constraintstwin node familymultistage stochastic mixed 0-1 programmingscenario cluster partitioning

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15)

Related Items

A parallelised distributed implementation of a branch and fix coordination algorithm, On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs, A hybrid scenario cluster decomposition algorithm for supply chain tactical planning under uncertainty, An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization, Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization, Cluster Lagrangean decomposition in multistage stochastic optimization, Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems, On air traffic flow management with rerouting. I: Deterministic case, Structuring Bilateral Energy Contract Portfolios in Competitive Markets, Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs, Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks, A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems, A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty, 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, Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Forestry management under uncertainty
• A heuristic procedure for stochastic integer programs with complete recourse
• 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
• 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
• 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 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 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
• Stochastic decomposition. A statistical method for large scale stochastic linear programming
• Conditional value-at-risk in stochastic programs with mixed-integer recourse
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Introduction to Stochastic Programming
• Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
• Programming Under Uncertainty: The Equivalent Convex Program
• Stochastic optimization: Algorithms and applications. Conference, Univ. of Florida, Tallahassee, FL, USA, February 20--22, 2000
• Benchmarking optimization software with performance profiles.