Robust discrete optimization problems with the WOWA criterion

DOI10.1007/978-3-319-28697-6_38zbMATH Open1347.90072OpenAlexW2466098314MaRDI QIDQ2806941FDOQ2806941

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

Recommendations

• Using the WOWA operator in robust discrete optimization problems
• Combinatorial optimization problems with uncertain costs and the OWA criterion
• Approximating combinatorial optimization problems with uncertain costs and the OWA criterion
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
• On Decision Support Under Risk by the WOWA Optimization

zbMATH Keywords

complexityapproximation algorithmweighted ordered weighted averaging aggregation operator

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• On efficient WOWA optimization for decision support under risk
• On Decision Support Under Risk by the WOWA Optimization
• Combinatorial optimization problems with balanced regret
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty

This page was built for publication: Robust discrete optimization problems with the WOWA criterion

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