JOURNAL ARTICLE

Robust min-max regret covering problems

Amadeu Almeida CocoAndréa Cynthia SantosThiago F. Noronha

Year: 2022 Journal:   Computational Optimization and Applications Vol: 83 (1)Pages: 111-141   Publisher: Springer Science+Business Media
Keywords:
Regret Mathematics Heuristics Heuristic Mathematical optimization Interval (graph theory) Set (abstract data type) Combinatorics Computer science Statistics

Metrics

5
Cited By
1.00
FWCI (Field Weighted Citation Impact)
50
Refs
0.75
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Risk and Portfolio Optimization
Social Sciences →  Decision Sciences →  Management Science and Operations Research
Facility Location and Emergency Management
Social Sciences →  Business, Management and Accounting →  Organizational Behavior and Human Resource Management
Optimization and Mathematical Programming
Physical Sciences →  Engineering →  Control and Systems Engineering

Related Documents

JOURNAL ARTICLE

Min max min robust (relative) regret combinatorial optimization

Alejandro Crema

Journal:   Mathematical Methods of Operations Research Year: 2020 Vol: 92 (2)Pages: 249-283
JOURNAL ARTICLE

Complexity of the min–max and min–max regret assignment problems

Hassène AissiCristina BazganDaniel Vanderpooten

Journal:   Operations Research Letters Year: 2005 Vol: 33 (6)Pages: 634-640
JOURNAL ARTICLE

Min–max and min–max regret versions of combinatorial optimization problems: A survey

Hassène AissiCristina BazganDaniel Vanderpooten

Journal:   European Journal of Operational Research Year: 2008 Vol: 197 (2)Pages: 427-438
JOURNAL ARTICLE

Robust min-max (regret) optimization using ordered weighted averaging

Werner BaakMarc GoerigkAdam KasperskiPaweł Zieliński

Journal:   European Journal of Operational Research Year: 2024 Vol: 322 (1)Pages: 171-181
© 2026 ScienceGate Book Chapters — All rights reserved.