On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty
From MaRDI portal
Publication:1026569
DOI10.1007/s10479-008-0411-5zbMath1163.90584OpenAlexW2076581858MaRDI QIDQ1026569
Laureano Fernando Escudero Bueno, Celeste Pizarro, Antonio Alonso-Ayuso
Publication date: 25 June 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0411-5
fix-and-relax coordinationsplitting variablesnon-anticipativity constraintsmulti-period single-source problemtwo-stage stochastic mixed 0-1 programs
Related Items (2)
Using and extending fix-and-relax to solve maritime inventory routing problems ⋮ Structuring Bilateral Energy Contract Portfolios in Competitive Markets
Cites Work
- On a fix-and-relax framework for a class of project scheduling problems
- On a stochastic sequencing and scheduling problem
- On solving the multi-period single-sourcing problem under uncertainty
- On practical resource allocation for production planning and scheduling with period overlapping setups
- 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.
- An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- 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
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- Dual Stochastic Dominance and Related Mean-Risk Models
This page was built for publication: On SIP algorithms for minimizing the mean-risk function in the multi-period single-source problem under uncertainty
