Query minimization under stochastic uncertainty
From MaRDI portal
Recommendations
Cites work
- A Robust Optimization Perspective on Stochastic Programming
- A stochastic probing problem with applications
- Adaptivity gaps for stochastic probing: submodular and XOS functions
- Algorithms and adaptivity gaps for stochastic probing
- An adversarial model for scheduling with testing
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Computing minimum spanning trees with uncertainty
- Computing shortest paths with uncertainty
- Computing the Median with Uncertainty
- Efficient update strategies for geometric computing with uncertainty
- scientific article; zbMATH DE number 1232130 (Why is no real title available?)
- scientific article; zbMATH DE number 7075885 (Why is no real title available?)
- scientific article; zbMATH DE number 7087296 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- Information collection for linear programs with uncertain objective coefficients
- Introduction to stochastic programming.
- Minimizing Interference Potential Among Moving Entities
- Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
- Minimum spanning tree verification under uncertainty
- Model-driven optimization using adaptive probes
- Multistage stochastic optimization
- On the complexity of the robust spanning tree problem with interval data
- Preprocessing Ambiguous Imprecise Points
- Query-competitive algorithms for cheapest set problems under uncertainty
- Query-competitive sorting with uncertainty
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Representation of a finite graph by a set of intervals on the real line
- Robust optimization - a comprehensive survey
- Stochastic packing integer programs with few queries
- Submodular stochastic probing on matroids
- The price of information in combinatorial optimization
- The robust knapsack problem with queries
- The robust spanning tree problem with interval data
- The update complexity of selection and related problems
- Theory and applications of robust optimization
- Verification problem of maximal points under uncertainty
Cited in
(7)- Easy and optimal queries to reduce set uncertainty
- Query-competitive sorting with uncertainty
- Query minimization under stochastic uncertainty
- Set selection under explorable stochastic uncertainty via covering techniques
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Identifying approximate minimizers under stochastic uncertainity
This page was built for publication: Query minimization under stochastic uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925528)
