A Probabilistic Model for Minmax Regret in Combinatorial Optimization
From MaRDI portal
Publication:5166306
DOI10.1287/OPRE.2013.1212zbMATH Open1291.90208OpenAlexW2160255775MaRDI QIDQ5166306FDOQ5166306
Authors: Karthik Natarajan, Dongjian Shi, Kim-Chuan Toh 
Publication date: 26 June 2014
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.2013.1212
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 (16)
- 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
- Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Risk-averse single machine scheduling: complexity and approximation
- Home health care facility location problem under demand uncertainty
- Robust Postdonation Blood Screening Under Prevalence Rate Uncertainty
- Approximating the min-max (regret) selecting items problem
- A relative robust approach on expected returns with bounded CVaR for portfolio selection
- Precise Minimax Redundancy and Regret
- Combinatorial optimization problems with balanced regret
- Computing and minimizing the relative regret in combinatorial optimization with interval data
- Frameworks and results in distributionally robust optimization
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)
