A parallelised distributed implementation of a branch and fix coordination algorithm
From MaRDI portal
Publication:319288
DOI10.1016/j.ejor.2015.01.004zbMath1346.90644OpenAlexW2020643105MaRDI QIDQ319288
Asgeir Tomasgard, Adela Pagès-Bernaus, Gerardo A. Pérez-Valdés
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.004
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Parallel numerical computation (65Y05)
Related Items (6)
Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization ⋮ Designing e‐commerce supply chains: a stochastic facility–location approach ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ 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 ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees. II: Parallelization
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
- On multistage stochastic integer programming for incorporating logical constraints in asset and liability management under uncertainty
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
- A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
- On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
- An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: some theoretical and experimental aspects
- Introduction to Stochastic Programming
This page was built for publication: A parallelised distributed implementation of a branch and fix coordination algorithm
