On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
From MaRDI portal
Recommendations
Cites work
Cited in
(8)- Minmax regret linear resource allocation problems.
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Complexity results and exact algorithms for robust knapsack problems
- The multi-Handler knapsack problem under uncertainty
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure
- Robust postdonation blood screening under prevalence rate uncertainty
- Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
This page was built for publication: On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2488199)