A Probabilistic Model for Minmax Regret in Combinatorial Optimization
From MaRDI portal
Publication:5166306
Recommendations
- Randomized minmax regret for combinatorial optimization under uncertainty
- Minmax regret combinatorial optimization problems: an algorithmic perspective
- Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Min max min robust (relative) regret combinatorial optimization
- On the complexity of minmax regret linear programming
- Minmax regret combinatorial optimization problems with investments
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
Cited in
(20)- Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
- Optimal Group Testing: Structural Properties and Robust Solutions, with Application to Public Health Screening
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Minmax regret combinatorial optimization problems with investments
- Technical note -- Risk-averse regret minimization in multistage stochastic programs
- Risk-averse single machine scheduling: complexity and approximation
- A minimum expected regret model for the shortest path problem with solution-dependent probability distributions
- Home health care facility location problem under demand uncertainty
- Approximating the min-max (regret) selecting items problem
- Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems
- Randomized minmax regret for combinatorial optimization under uncertainty
- A relative robust approach on expected returns with bounded CVaR for portfolio selection
- Precise Minimax Redundancy and Regret
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Combinatorial optimization problems with balanced regret
- Frameworks and results in distributionally robust optimization
- Robust postdonation blood screening under prevalence rate uncertainty
This page was built for publication: A Probabilistic Model for Minmax Regret in Combinatorial Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166306)
