A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
From MaRDI portal
Publication:2480254
DOI10.1007/s10479-006-0138-0zbMath1144.90454OpenAlexW2166234212MaRDI QIDQ2480254
María Merino, Gloria Pérez, María Araceli Garín, Laureano Fernando Escudero Bueno
Publication date: 31 March 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0138-0
Related Items (17)
On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty ⋮ 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 ⋮ Stochastic multi-site capacity planning of TFT-LCD manufacturing using expected shadow-price based decomposition ⋮ An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects ⋮ A two-stage stochastic mixed-integer programming approach to the index tracking problem ⋮ A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems ⋮ 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 ⋮ Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning ⋮ Structuring Bilateral Energy Contract Portfolios in Competitive Markets ⋮ Multicut Benders decomposition algorithm for process supply chain planning under uncertainty ⋮ The ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming ⋮ A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty ⋮ Stochastic set packing problem ⋮ An approach to the valuation and decision of ERP investment projects based on real options ⋮ 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
- Partitioning procedures for solving mixed-variables programming problems
- Dual decomposition in stochastic integer programming
- A model for portfolio management with mortgage-backed securities
- 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.
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Introduction to Stochastic Programming
- Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
This page was built for publication: A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
