On BFC-MSMIP strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
From MaRDI portal
(Redirected from Publication:1040974)
On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
Recommendations
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
- Scalable branching on dual decomposition of stochastic mixed-integer programming problems
- A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
- A two-stage parallel branch and bound algorithm for mixed integer programs
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- A finite branch-and-bound algorithm for two-stage stochastic integer programs
- Enhanced cut generation methods for decomposition-based branch and cut for two-stage stochastic mixed-integer programs
- Two-stage stochastic mixed-integer programs: algorithms and insights
Cites work
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 1233792 (Why is no real title available?)
- scientific article; zbMATH DE number 1304958 (Why is no real title available?)
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- scientific article; zbMATH DE number 772850 (Why is no real title available?)
- A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
- A heuristic procedure for stochastic integer programs with complete recourse
- A stochastic 0-1 program based approach for the air traffic flow management problem
- A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
- Benchmarking optimization software with performance profiles.
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- Forestry management under uncertainty
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- Introduction to Stochastic Programming
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
- On a stochastic sequencing and scheduling problem
- On stochastic dynamic programming for solving large-scale planning problems under uncertainty
- Programming Under Uncertainty: The Equivalent Convex Program
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- Stochastic optimization: Algorithms and applications. Conference, Univ. of Florida, Tallahassee, FL, USA, February 20--22, 2000
- Stochastic programming computer implementations
- The million-variable ``march for stochastic combinatorial optimization
Cited in
(17)- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
- Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization
- On solving strong multistage nonsymmetric stochastic mixed 0-1 problems
- A branch-and-cluster coordination scheme for selecting prison facility sites under uncertainty
- Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems
- A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems
- Structuring bilateral energy contract portfolios in competitive markets
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
- Sampling Scenario Set Partition Dual Bounds for Multistage Stochastic Programs
- An algorithmic framework for solving large-scale multistage stochastic mixed 0-1 problems with nonsymmetric scenario trees
- Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic
- 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
- Cluster Lagrangean decomposition in multistage stochastic optimization
- On air traffic flow management with rerouting. I: Deterministic case
This page was built for publication: On \(BFC-MSMIP\) strategies for scenario cluster partitioning, and twin node family branching selection and bounding for multistage stochastic mixed integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1040974)
