On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
From MaRDI portal
Publication:839882
DOI10.1007/s11750-009-0090-7zbMath1170.90445OpenAlexW2061871702MaRDI QIDQ839882
Laureano Fernando Escudero Bueno
Publication date: 3 September 2009
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-009-0090-7
branch-and-fix coordinationLagrangian substitution and decompositionmean-risk measuresmultistage stochastic integer programming
Related Items (7)
A two-stage stochastic transportation problem with fixed handling costs and a priori selection of the distribution channels ⋮ Lagrangian decomposition for large-scale two-stage stochastic mixed 0-1 problems ⋮ On air traffic flow management with rerouting. II: Stochastic case ⋮ Structuring Bilateral Energy Contract Portfolios in Competitive Markets ⋮ A parallel branch-and-fix coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0-1 problems ⋮ Stochastic set packing problem ⋮ 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
- Unnamed Item
- Unnamed Item
- Forestry management under uncertainty
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A heuristic procedure for stochastic integer programs with complete recourse
- BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0-1 problems
- On a stochastic sequencing and scheduling problem
- On solving the multi-period single-sourcing problem under uncertainty
- A general algorithm for solving two-stage stochastic mixed \(0-1\) first-stage problems
- Partitioning procedures for solving mixed-variables programming problems
- A diagonal quadratic approximation method for large scale linear programs
- Stochastic vehicle routing
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Dual decomposition in stochastic integer programming
- 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.
- A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- The volume algorithm: Producing primal solutions with a subgradient method
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- A parallel computation approach for solving multistage stochastic network problems
- A two-stage planning model for power scheduling in a hydro-thermal system under uncertainty
- Lagrangean relaxation. (With comments and rejoinder).
- Optimal capacity allocation in multi-auction electricity markets under uncertainty
- Computational solution of capacity planning models under uncertainty
- A two-stage stochastic integer programming approach as a mixture of branch-and-fix coordination and Benders decomposition schemes
- A stochastic programming approach for supply chain network design under uncertainty
- Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
- The million-variable ``march for stochastic combinatorial optimization
- On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs
- The Traveling-Salesman Problem and Minimum Spanning Trees
This page was built for publication: On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
