BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.

DOI10.1016/S0377-2217(02)00628-8zbMath1053.90101MaRDI QIDQ1410308

Antonio Alonso-Ayuso, M. Teresa Ortuño, Laureano Fernando Escudero Bueno

Publication date: 14 October 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Stochastic programmingMixed 0--1 programsMultistage scenario treeSplitting variables representationTwin node families

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15)

Related Items (56)

A heuristic procedure for stochastic integer programs with complete recourse ⋮ On the impact of deep learning-based time-series forecasts on multistage stochastic programming policies ⋮ Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problems ⋮ Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation ⋮ Medium range optimization of copper extraction planning under uncertainty in future copper prices ⋮ 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 ⋮ 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 ⋮ K-Adaptability in Two-Stage Robust Binary Programming ⋮ Fix-and-relax-coordination for a multi-period location-allocation problem under uncertainty ⋮ An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization ⋮ The value of the stochastic solution in multistage problems ⋮ Scenario cluster decomposition of the Lagrangian dual in two-stage stochastic mixed 0-1 optimization ⋮ PySP: modeling and solving stochastic programs in Python ⋮ An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects ⋮ On a stochastic sequencing and scheduling problem ⋮ On the enrouting protocol problem under uncertainty ⋮ A computational comparison of several formulations for the multi-period incremental service facility location problem ⋮ Stochastic dual dynamic integer programming ⋮ A branch-and-bound method for multistage stochastic integer programs with risk objectives ⋮ Designing e‐commerce supply chains: a stochastic facility–location approach ⋮ A Priori and A Posteriori Aggregation Procedures to Reduce Model Size in MIP Mine Planning Models ⋮ Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems ⋮ Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems ⋮ Stochastic forestry planning under market and growth uncertainty ⋮ 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 ⋮ On air traffic flow management with rerouting. I: Deterministic case ⋮ On air traffic flow management with rerouting. II: Stochastic case ⋮ Recent Progress in Two-stage Mixed-integer Stochastic Programming with Applications to Power Production Planning ⋮ Structuring Bilateral Energy Contract Portfolios in Competitive Markets ⋮ Convex approximations for a class of mixed-integer recourse models ⋮ A scenario decomposition algorithm for 0-1 stochastic programs ⋮ Forestry management under uncertainty ⋮ Risk Aversion in Two-Stage Stochastic Integer Programming ⋮ Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights ⋮ Risk management for forestry planning under uncertainty in demand and prices ⋮ A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes ⋮ A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty ⋮ A heuristic block coordinate descent approach for controlled tabular adjustment ⋮ On deviation measures in stochastic integer programming ⋮ On greedy approximation algorithms for a class of two-stage stochastic assignment problems ⋮ Stochastic set packing problem ⋮ A generalized Benders decomposition-based branch and cut algorithm for two-stage stochastic programs with nonconvex constraints and mixed-binary first and second stage variables ⋮ Two-stage integer programs with stochastic right-hand sides: A superadditive dual approach ⋮ A fuzzy model for shortage planning under uncertainty due to lack of homogeneity in planned production lots ⋮ A comparative study of decomposition algorithms for stochastic combinatorial optimization ⋮ A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems ⋮ Stochastic optimization models in forest planning: a progressive hedging solution approach ⋮ On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty ⋮ 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 ⋮ A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs ⋮ B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• Partitioning procedures for solving mixed-variables programming problems
• Stochastic integer programming: general models and algorithms
• Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Dual decomposition in stochastic integer programming
• Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
• 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
• Schumann, a modeling framework for supply chain management under uncertainty
• A parallel computation approach for solving multistage stochastic network problems
• Conflict graphs in solving integer programming problems
• Stochastic decomposition. A statistical method for large scale stochastic linear programming
• Linear Programming under Uncertainty
• The Air Traffic Flow Management Problem with Enroute Capacities
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Introduction to Stochastic Programming
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• A Computational Study of Search Strategies for Mixed Integer Programming
• Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
• Robust Optimization of Large-Scale Systems
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming

This page was built for publication: BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.