The computational complexity of stochastic optimization

DOI10.1007/978-3-319-09174-7_15MaRDI QIDQ3195326zbMATH OpenOpenAlexFDO

Authors C. P. De Campos, Georgios Stamoulis, Dennis Weyland

Publication date 16 October 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-09174-7_15

zbMATH Keywords

computational complexitychance constraintsstochastic vehicle routingstochastic combinatorial optimization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Stochastic programming (90C15)

Recommendations

• On complexity of stochastic programming problems
• Computational complexity of stochastic programming problems
• On the relation between complexity and uncertainty
• Stochastic programming approach to optimization under uncertainty
• Computational complexity of stochastic programming: Monte Carlo sampling approach

Cited in

(5)

• Stochastic lot-sizing with backlogging: computational complexity analysis
• On the Computational Complexity of Stochastic Controller Optimization in POMDPs
• Computational complexity of combinatorial optimization problems induced by collective procedures in machine learning
• On the relation between complexity and uncertainty
• A structured view on weighted counting with relations to counting, quantum computation and applications

This page was built for publication: The computational complexity of stochastic optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195326)