Computational complexity of stochastic programming problems
From MaRDI portal
Recommendations
- On complexity of stochastic programming problems
- Computational complexity of stochastic programming: Monte Carlo sampling approach
- Stochastic programming approach to optimization under uncertainty
- A comment on ``Computational complexity of stochastic programming problems
- On the information-based complexity of stochastic programming
Cites work
- scientific article; zbMATH DE number 995813 (Why is no real title available?)
- scientific article; zbMATH DE number 4053339 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 18983 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 663895 (Why is no real title available?)
- scientific article; zbMATH DE number 1175949 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A simple randomised algorithm for convex optimisation
- Analysis of Heuristics for Stochastic Programming: Results for Hierarchical Scheduling Problems
- Games against nature
- Geometric algorithms and combinatorial optimization
- Introduction to Stochastic Programming
- On the Complexity of Computing the Volume of a Polyhedron
- PP is as Hard as the Polynomial-Time Hierarchy
- Polytope Volume Computation
- Stochastic programming with simple integer recourse
- The Complexity of Enumeration and Reliability Problems
- Variational Analysis
Cited in
(61)- The computational complexity of stochastic optimization
- scientific article; zbMATH DE number 4051350 (Why is no real title available?)
- On sample average approximation for two-stage stochastic programs without relatively complete recourse
- On the approximability of adjustable robust convex optimization under uncertainty
- Compromise policy for multi-stage stochastic linear programming: variance and bias reduction
- Distributionally robust optimization
- On the scenario-tree optimal-value error for stochastic programming problems
- Two‐stage stochastic integer programming: a survey
- A survey of adjustable robust optimization
- A multi-stage stochastic programming approach in master production scheduling
- Hydrological scenario reduction for stochastic optimization in hydrothermal power systems
- On the information-based complexity of stochastic programming
- On greedy approximation algorithms for a class of two-stage stochastic assignment problems
- Uncertain random programming models in the framework of U-S chance theory and their applications
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- Maximizing the expected net present value in a project with uncertain cash flows
- Stochastic joint homecare service and capacity planning with nested decomposition approaches
- scientific article; zbMATH DE number 4108494 (Why is no real title available?)
- A study of the threshold stability of the bilevel problem of facility location and discriminatory pricing
- A stochastic program with time series and affine decision rules for the reservoir management problem
- Stochastic Dynamic Linear Programming: A Sequential Sampling Algorithm for Multistage Stochastic Linear Programming
- An approximation framework for two-stage ambiguous stochastic integer programs under mean-MAD information
- Generalized decision rule approximations for stochastic programming via liftings
- Computational complexity of stochastic programming: Monte Carlo sampling approach
- Stochastic programming approach to optimization under uncertainty
- Piecewise static policies for two-stage adjustable robust linear optimization
- Discrete approximation and convergence analysis for a class of decision-dependent two-stage stochastic linear programs
- A comment on ``Computational complexity of stochastic programming problems
- Problem-driven scenario clustering in stochastic optimization
- Modeling methods and a branch and cut algorithm for pharmaceutical clinical trial planning using stochastic programming
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set
- A unified framework for multistage mixed integer linear optimization
- Multistage stochastic portfolio optimisation in deregulated electricity markets using linear decision rules
- Decision rule approximations for the risk averse reservoir management problem
- A survey on metaheuristics for stochastic combinatorial optimization
- Exact Quantization of Multistage Stochastic Linear Problems
- Step decision rules for multistage stochastic programming: a heuristic approach
- Confidence-based reasoning in stochastic constraint programming
- Convex approximations for a class of mixed-integer recourse models
- Solving multistage quantified linear optimization problems with the alpha-beta nested Benders decomposition
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs
- Two-stage linear decision rules for multi-stage stochastic programming
- Submodular reassignment problem for reallocating agents to tasks with synergy effects
- Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
- On the computational complexity of the probabilistic traveling salesman problem with deadlines
- Primal and dual linear decision rules in stochastic and robust optimization
- Two-stage distributionally robust mixed-integer optimization model for three-level location-allocation problems under uncertain environment
- On the relation between complexity and uncertainty
- Robust and stochastic formulations for ambulance deployment and dispatch
- The distributionally robust chance-constrained vehicle routing problem
- Quality evaluation of scenario-tree generation methods for solving stochastic programming problems
- Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
- On complexity of multistage stochastic programs
- On complexity of stochastic programming problems
- Approximation algorithms for stochastic and risk-averse optimization
- Augmented simulation methods for discrete stochastic optimization with recourse
- Binary decision rules for multistage adaptive mixed-integer optimization
- A structured view on weighted counting with relations to counting, quantum computation and applications
- The submodularity of two-stage stochastic maximum-weight independent set problems
- Two-stage stochastic max-weight independent set problems
- Decision rule bounds for two-stage stochastic bilevel programs
This page was built for publication: Computational complexity of stochastic programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2492669)
