Pages that link to "Item:Q1887882"
From MaRDI portal
The following pages link to On the complexity of minmax regret linear programming (Q1887882):
Displaying 22 items.
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
- Robust optimal solutions in interval linear programming with forall-exists quantifiers (Q323404) (← links)
- On a constant factor approximation for minmax regret problems using a symmetry point scenario (Q439704) (← links)
- Violation analysis on two-step method for interval linear programming (Q507647) (← links)
- Robust combinatorial optimization under convex and discrete cost uncertainty (Q668950) (← links)
- Regret minimization, willingness-to-accept-losses and framing (Q849742) (← links)
- On the approximability of minmax (regret) network optimization problems (Q976089) (← links)
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution (Q991475) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- Robustness in operational research and decision aiding: a multi-faceted issue (Q1044079) (← links)
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights (Q1044085) (← links)
- Minmax regret linear resource allocation problems. (Q1417598) (← links)
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets (Q1698883) (← links)
- Pessimistic, optimistic, and minimax regret approaches for linear programs under uncertainty (Q1794445) (← links)
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients (Q2282559) (← links)
- Constraint-based optimization and utility elicitation using the minimax decision criterion (Q2457617) (← links)
- Linear programming with interval right hand sides (Q3566454) (← links)
- Best and Worst Optimum for Linear Programs with Interval Right Hand Sides (Q3627684) (← 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)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)