Recommendations
Cites work
- A First Course in Order Statistics
- Approximation algorithms for the weight-reducible knapsack problem
- Computing minimum spanning trees with uncertainty
- Computing the Median with Uncertainty
- Exact solution of the robust knapsack problem
- Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem
- scientific article; zbMATH DE number 1962828 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Information collection for linear programs with uncertain objective coefficients
- Introduction to stochastic programming.
- Model-driven optimization using adaptive probes
- On the robust knapsack problem
- Recoverable robust knapsacks: -scenarios
- Recoverable robust knapsacks: the discrete scenario case
- Robust combinatorial optimization with variable budgeted uncertainty
- Robust convex optimization
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust optimization
- Robust solutions of uncertain linear programs
- The Price of Robustness
Cited in
(22)- Improved online algorithm for fractional knapsack in the random order model
- Explorable uncertainty in scheduling with non-uniform testing times
- Two-stage robust optimization problems with two-stage uncertainty
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- An adversarial model for scheduling with testing
- A robust optimization approach with probe-able uncertainty
- Complexity results and exact algorithms for robust knapsack problems
- A note on upper bounds to the robust knapsack problem with discrete scenarios
- Query-competitive sorting with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- Randomization helps computing a minimum spanning tree under uncertainty
- Algorithms for queryable uncertainty
- Scheduling with explorable uncertainty
- Query-Competitive Sorting with Uncertainty.
- Randomization Helps Computing a Minimum Spanning Tree under Uncertainty
- Query minimization under stochastic uncertainty
- Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
- Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty
- The robust selection problem with information discovery
- Learning-augmented query policies for minimum spanning tree with uncertainty
- Round-competitive algorithms for uncertainty problems with parallel queries
- Scheduling with testing on multiple identical parallel machines
This page was built for publication: The robust knapsack problem with queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337391)
