Robust min-max regret covering problems

Amadeu Almeida Coco; Andréa Cynthia Santos; Thiago F. Noronha

doi:10.1007/s10589-022-00391-x

ScienceGate Book Chapters

JOURNAL ARTICLE

Robust min-max regret covering problems

Amadeu Almeida Coco Andréa Cynthia Santos Thiago F. Noronha

Year: 2022 Journal: Computational Optimization and Applications Vol: 83 (1)Pages: 111-141 Publisher: Springer Science+Business Media

DOI: 10.1007/s10589-022-00391-x

Get Full-Text PDF Get Analytical Report

Keywords:

Regret Mathematics Heuristics Heuristic Mathematical optimization Interval (graph theory) Set (abstract data type) Combinatorics Computer science Statistics

Metrics

Cited By

1.00

FWCI (Field Weighted Citation Impact)

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

Robust min-max regret covering problems

Metrics

Citation History

Topics

Related Documents

Min max min robust (relative) regret combinatorial optimization

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

Scenario relaxation algorithm for finite scenario-based min–max regret and min–max relative regret robust optimization

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

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