Pages that link to "Item:Q2488199"
From MaRDI portal
The following pages link to On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (Q2488199):
Displaying 6 items.
- Minmax regret bottleneck problems with solution-induced interval uncertainty structure (Q429655) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty (Q4969303) (← links)
- Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems (Q5058052) (← links)
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives (Q5085488) (← links)
