Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems

DOI10.1007/978-3-642-13935-2_13MaRDI QIDQ3055576zbMATH OpenOpenAlexFDO

Authors Adam Kasperski, Paweł Zieliński

Publication date 8 November 2010

Published in Fuzzy Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13935-2_13

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Recommendations

• Minmax regret combinatorial optimization problems: an algorithmic perspective
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• A Probabilistic Model for Minmax Regret in Combinatorial Optimization
• Approximation of min-max and min-max regret versions of some combinatorial optimization problems
• Minmax regret combinatorial optimization problems with investments
• Min max min robust (relative) regret combinatorial optimization
• Computing and minimizing the relative regret in combinatorial optimization with interval data
• Combinatorial optimization problems with balanced regret
• Complexity of the min-max and min-max regret assignment problems
• On the complexity of minmax regret linear programming

Cited in

(5)

• Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
• Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets
• Bottleneck combinatorial optimization problems with fuzzy scenarios
• A Probabilistic Model for Minmax Regret in Combinatorial Optimization
• Discrete optimization with interval data. Minmax regret and fuzzy approach

This page was built for publication: Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055576)