Minmax regret combinatorial optimization problems: an algorithmic perspective
From MaRDI portal
Recommendations
- Minmax regret solutions for minimax optimization problems with uncertainty
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Min max min robust (relative) regret combinatorial optimization
- Randomized minmax regret for combinatorial optimization under uncertainty
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
Cited in
(30)- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minmax regret solutions for minimax optimization problems with uncertainty
- Robust minmax regret combinatorial optimization problems with a resource-dependent uncertainty polyhedron of scenarios
- Minmax regret combinatorial optimization problems with investments
- Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
- Min-max and min-max (relative) regret approaches to representatives selection problem
- Approximating the min-max (regret) selecting items problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Algorithms for the minmax regret path problem with interval data
- Min max min robust (relative) regret combinatorial optimization
- Combinatorial two-stage minmax regret problems under interval uncertainty
- Maximum excess dominance: identifying impractical solutions in linear problems with interval coefficients
- Minmax regret k-sink location on a dynamic path network with uniform capacities
- Combinatorial optimization problems with balanced regret
- The minmax regret robust shortest path problem in a finite multi-scenario model
- Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
- On exact solutions for the minmax regret spanning tree problem
- Randomized minmax regret for combinatorial optimization under uncertainty
- Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem
- Precise Minimax Redundancy and Regret
- On a constant factor approximation for minmax regret problems using a symmetry point scenario
- Efficient Algorithms for k-Regret Minimizing Sets
- Extensions of labeling algorithms for multi-objective uncertain shortest path problems
- An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
- An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion
- A Probabilistic Model for Minmax Regret in Combinatorial Optimization
- Robust optimization of sums of piecewise linear functions with application to inventory problems
- On the complexity of a class of combinatorial optimization problems with uncertainty
- Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. (Abstract of Thesis)
- Min-max regret robust optimization approach on interval data uncertainty
This page was built for publication: Minmax regret combinatorial optimization problems: an algorithmic perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917217)
