Pages that link to "Item:Q1417598"
From MaRDI portal
The following pages link to Minmax regret linear resource allocation problems. (Q1417598):
Displaying 10 items.
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- On the complexity of minmax regret linear programming (Q1887882) (← links)
- Resource allocation problems with concave reward functions (Q2421324) (← links)
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients (Q2488199) (← links)
- Resource optimization and (min,+) spectral theory (Q4859739) (← 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)
