On the complexity of minmax regret linear programming
From MaRDI portal
Recommendations
- Minmax regret solutions for minimax optimization problems with uncertainty
- On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
- Minimax regret solution to linear programming problems with an interval objective function
- scientific article; zbMATH DE number 721836
- Minmax regret linear resource allocation problems.
Cites work
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
- A new polynomial-time algorithm for linear programming
- A possibilistic linear program is equivalent to a stochastic linear program in a special case
- Minimax regret solution to linear programming problems with an interval objective function
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The complexity of satisfiability problems
Cited in
(34)- Robustness in operational research and decision aiding: a multi-faceted issue
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Linear programming with interval right hand sides
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty
- Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
- Complexity of the min-max and min-max regret assignment problems
- Approximating the min-max (regret) selecting items problem
- Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems
- A Probabilistic Model for Minmax Regret in Combinatorial Optimization
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
- Efficient Algorithms for k-Regret Minimizing Sets
- Robust combinatorial optimization under convex and discrete cost uncertainty
- Precise Minimax Redundancy and Regret
- Regret minimization, willingness-to-accept-losses and framing
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- Minmax regret linear resource allocation problems.
- On the approximability of minmax (regret) network optimization problems
- A heuristic to minimax absolute regret for linear programs with interval objective function coefficients
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- A 2-approximation for minmax regret problems via a mid-point scenario optimal solution
- Best and Worst Optimum for Linear Programs with Interval Right Hand Sides
- Robust optimal solutions in interval linear programming with forall-exists quantifiers
- Robust postdonation blood screening under prevalence rate uncertainty
- Minimising the maximum relative regret for linear programmes with interval objective function coefficients
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- Pessimistic, optimistic, and minimax regret approaches for linear programs under uncertainty
- Violation analysis on two-step method for interval linear programming
- On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Constraint-based optimization and utility elicitation using the minimax decision criterion
- On the complexity of the continuous unbounded knapsack problem with uncertain coefficients
This page was built for publication: On the complexity of minmax regret linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887882)
