Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion
From MaRDI portal
Publication:2287157
DOI10.1134/S0005117919010041zbMath1437.90113OpenAlexW2935229915MaRDI QIDQ2287157
A. I. Kibzun, Sergey V. Ivanov, Nenad Mladenović
Publication date: 23 January 2020
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117919010041
variable neighborhood searchsample approximationconfidence methodtwo-stage problemquantile criterion
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variable neighbourhood search: methods and applications
- Sample average approximation method for chance constrained programming: Theory and applications
- Variable neighborhood search
- Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
- On the convergence of sample approximations for stochastic programming problems with probabilistic criteria
- Variable neighborhood search: basics and variants
- Reducing two-stage probabilistic optimization problems with discrete distribution of random data to mixed-integer programming problems
- A mixed integer linear programming formulation of the optimal mean/Value-at-Risk portfolio problem
- Lectures on Stochastic Programming
- Introduction to Stochastic Programming
- Non-asymptotic confidence bounds for the optimal value of a stochastic program
- Comparison of two algorithms for solving a two‐stage bilinear stochastic programming problem with quantile criterion
- A branch and bound method for stochastic integer problems under probabilistic constraints
- Approximation of the quantile minimization problem with decision rules
This page was built for publication: Variable neighborhood search for a two-stage stochastic programming problem with a quantile criterion