Min max min robust (relative) regret combinatorial optimization

Alejandro Crema

doi:10.1007/s00186-020-00712-y

ScienceGate Book Chapters

JOURNAL ARTICLE

Min max min robust (relative) regret combinatorial optimization

Alejandro Crema

Year: 2020 Journal: Mathematical Methods of Operations Research Vol: 92 (2)Pages: 249-283 Publisher: Springer Science+Business Media

DOI: 10.1007/s00186-020-00712-y

Get Full-Text PDF Get Analytical Report

Keywords:

Regret Mathematical optimization Set (abstract data type) Robust optimization Mathematics Combinatorial optimization Optimization problem Computer science Algorithm Statistics

Metrics

Cited By

0.74

FWCI (Field Weighted Citation Impact)

Refs

0.74

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

Multi-Criteria Decision Making

Social Sciences → Decision Sciences → Management Science and Operations Research

Supply Chain and Inventory Management

Social Sciences → Business, Management and Accounting → Management Information Systems

Min max min robust (relative) regret combinatorial optimization

Metrics

Citation History

Topics

Related Documents

Relative Robust Portfolio Optimization with benchmark regret

Regret in Online Combinatorial Optimization

Multiobjective optimization under uncertainty: A multiobjective robust (relative) regret approach

Computing and minimizing the relative regret in combinatorial optimization with interval data

Combinatorial optimization problems with balanced regret