A branch-and-bound method for multistage stochastic integer programs with risk objectives
From MaRDI portal
Publication:3498593
DOI10.1080/02331930701779906zbMath1134.90453OpenAlexW2073815369MaRDI QIDQ3498593
Rüdiger Schultz, Thomas S. Heinze
Publication date: 15 May 2008
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: http://edoc.hu-berlin.de/18452/9029
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15)
Related Items (1)
Cites Work
- Unnamed Item
- Risk neutral and risk averse power optimization in electricity networks with dispersed generation
- Dual decomposition in stochastic integer programming
- 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
- Duality gaps in nonconvex stochastic optimization
- On deviation measures in stochastic integer programming
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- Coherent Measures of Risk
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- Variational Analysis
- Risk Aversion via Excess Probabilities in Stochastic Programs with Mixed-Integer Recourse
- Optimization with Stochastic Dominance Constraints
- Dual Stochastic Dominance and Related Mean-Risk Models
- Polyhedral Risk Measures in Stochastic Programming
- Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty
This page was built for publication: A branch-and-bound method for multistage stochastic integer programs with risk objectives