Combinatorial optimization problems with balanced regret
From MaRDI portal
Recommendations
- Min max min robust (relative) regret combinatorial optimization
- Minmax regret solutions for minimax optimization problems with uncertainty
- Minmax regret combinatorial optimization problems: an algorithmic perspective
- A Probabilistic Model for Minmax Regret in Combinatorial Optimization
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
Cites work
- A double oracle approach to minmax regret optimization problems with interval data
- A linear time algorithm for the robust recoverable selection problem
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem
- A survey of adjustable robust optimization
- Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- An exact algorithm for the robust shortest path problem with interval data
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Approximating the min-max (regret) selecting items problem
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
- Combinatorial two-stage minmax regret problems under interval uncertainty
- Complexity and in-approximability of a selection problem in robust optimization
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- scientific article; zbMATH DE number 3947944 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Interval data minmax regret network optimization problems
- Introduction to algorithms.
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Minmax regret combinatorial optimization problems with investments
- Multistage robust discrete optimization via quantified integer programming
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- On scenario aggregation to approximate robust combinatorial optimization problems
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Pinpointing the complexity of the interval min-max regret knapsack problem
- Recoverable robust representatives selection problems with discrete budgeted uncertainty
- Robust discrete optimization and its applications
- Robust discrete optimization and network flows
- Robust discrete optimization problems with the WOWA criterion
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- Robust multistage optimization with decision-dependent uncertainty
- Robust recoverable and two-stage selection problems
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- The Price of Robustness
Cited in
(7)- Robust regret for uncertain linear programs with application to co-production models
- Competitive difference analysis of the cash management problem with uncertain demands
- Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
- Randomized minmax regret for combinatorial optimization under uncertainty
- Adjustable robust optimization reformulations of two-stage worst-case regret minimization problems
- A single representative min-max-min robust selection problem with alternatives and budgeted uncertainty
- Combinatorial Optimization Problems with Balanced Regret
This page was built for publication: Combinatorial optimization problems with balanced regret
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2685694)
