Robust Discrete Optimization Problems with the WOWA Criterion

DOI10.1007/978-3-319-28697-6_38zbMath1347.90072OpenAlexW2466098314MaRDI QIDQ2806941

Adam Kasperski, Paweł Zieliński

Publication date: 19 May 2016

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-28697-6_38

zbMATH Keywords

complexityapproximation algorithmweighted ordered weighted averaging aggregation operator

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27)

Related Items (2)

Combinatorial optimization problems with balanced regret ⋮ Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty

Cites Work

• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
• Combinatorial optimization problems with uncertain costs and the OWA criterion
• On efficient WOWA optimization for decision support under risk
• On the approximability of minmax (regret) network optimization problems
• Approximating the min-max (regret) selecting items problem
• The weighted OWA operator
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking

This page was built for publication: Robust Discrete Optimization Problems with the WOWA Criterion