Minmax regret linear resource allocation problems.
From MaRDI portal
Publication:1417598
DOI10.1016/S0167-6377(03)00091-9zbMath1137.90752OpenAlexW2046217872MaRDI QIDQ1417598
Publication date: 5 January 2004
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00091-9
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
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, On a constant factor approximation for minmax regret problems using a symmetry point scenario, On the complexity of the continuous unbounded knapsack problem with uncertain coefficients, Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty, Min-max and min-max regret versions of combinatorial optimization problems: A survey, Complexity of the min-max and min-max regret assignment problems
Cites Work
- Robust discrete optimization and its applications
- On the complexity of minmax regret linear programming
- Robust Convex Optimization
- Robust Optimization of Large-Scale Systems
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
- Unnamed Item
- Unnamed Item