A randomized algorithm for the min-Max selecting items problem with uncertain weights
From MaRDI portal
(Redirected from Publication:2267304)
Recommendations
- Approximating the min-max (regret) selecting items problem
- A computational study of approximation algorithms for a minmax resource allocation problem
- Improved approximation algorithms for the Min-Max selecting items problem
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Robust recoverable and two-stage selection problems
Cites work
- A note on the max-min 0-1 knapsack problem
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Commitment Under Uncertainty: Two-Stage Stochastic Matching Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- On the approximability of minmax (regret) network optimization problems
- On the complexity of a class of combinatorial optimization problems with uncertainty
- On the Max-Min 0-1 Knapsack Problem with Robust Optimization Applications
- On the robust shortest path problem.
- Robust discrete optimization and its applications
- The smallest uniform upper bound on the distance between the mean and the median of the binomial and Poisson distributions
Cited in
(13)- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Approximating the min-max (regret) selecting items problem
- A parameterized view to the robust recoverable base problem of matroids under structural uncertainty
- Robust recoverable and two-stage selection problems
- Complexity results for common due date scheduling problems with interval data and minmax regret criterion
- Improved approximation algorithms for the Min-Max selecting items problem
- The minimum expectation selection problem
- Combinatorial optimization problems with uncertain costs and the OWA criterion
- A computational study of approximation algorithms for a minmax resource allocation problem
- On the approximability of robust spanning tree problems
- Benchmarking problems for robust discrete optimization
- The robust bilevel selection problem
This page was built for publication: A randomized algorithm for the min-Max selecting items problem with uncertain weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267304)
