On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
type: Item
instance of: scholarly article
title: On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
zbMATH Open document ID: 1176.90422
author: A. Garin
author: María Merino
author: Gloria Pérez
author: Laureano F. Escudero Bueno
published in: Computers \& Operations Research
publication date: 2009-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 5639645
zbMATH Keywords: multistage stochastic mixed 0-1 programming
zbMATH Keywords: branch-and-fix coordination
zbMATH Keywords: nonanticipativity constraints
zbMATH Keywords: twin node family
zbMATH Keywords: scenario cluster partitioning
MaRDI profile type: Publication
full work available at URL: j.cor.2009.06.023
OpenAlex ID: W1966306904
cites work: An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
cites work: Forestry management under uncertainty
cites work: A stochastic 0-1 program based approach for the air traffic flow management problem
cites work: BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
cites work: On a stochastic sequencing and scheduling problem
cites work: Introduction to Stochastic Programming
cites work: On stochastic dynamic programming for solving large-scale planning problems under uncertainty
cites work: Q4251871
cites work: Benchmarking optimization software with performance profiles.
cites work: On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
cites work: A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
cites work: A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
cites work: BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
cites work: Stochastic decomposition. A statistical method for large scale stochastic linear programming
cites work: Q4309474
cites work: A heuristic procedure for stochastic integer programs with complete recourse
cites work: The million-variable ``march'' for stochastic combinatorial optimization
cites work: From stochastic dominance to mean-risk models: Semideviations as risk measures
cites work: Q4838490
cites work: Scenarios and Policy Aggregation in Optimization Under Uncertainty
cites work: Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
cites work: Conditional value-at-risk in stochastic programs with mixed-integer recourse
cites work: Stochastic optimization: Algorithms and applications. Conference, Univ. of Florida, Tallahassee, FL, USA, February 20--22, 2000
cites work: Q3372248
cites work: Programming Under Uncertainty: The Equivalent Convex Program
cites work: Q4054818
cites work: Q4223182
DOI: 10.1016/J.COR.2009.06.023
Recommended article: BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
Recommended article: Scalable branching on dual decomposition of stochastic mixed-integer programming problems
Recommended article: A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
Recommended article: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
Recommended article: Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
Recommended article: A two-stage parallel branch and bound algorithm for mixed integer programs
Recommended article: A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
Recommended article: A finite branch-and-bound algorithm for two-stage stochastic integer programs
Recommended article: Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs
Recommended article: Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights
description: scientific article; zbMATH DE number 5639645