Robust discrete optimization problems with the WOWA criterion

DOI10.1007/978-3-319-28697-6_38MaRDI QIDQ2806941zbMATH OpenOpenAlexFDO

Authors 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

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

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

Cites work

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

Cited in

(10)

• On efficient WOWA optimization for decision support under risk
• On Decision Support Under Risk by the WOWA Optimization
• Approximating combinatorial optimization problems with the ordered weighted averaging criterion
• Using the WOWA operator in robust discrete optimization problems
• Combinatorial optimization problems with uncertain costs and the OWA criterion
• Combinatorial optimization problems with balanced regret
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
• Approximating combinatorial optimization problems with uncertain costs and the OWA criterion
• Min-max-min robustness for combinatorial problems with discrete budgeted uncertainty
• Anytime algorithms for adaptive robust optimization with OWA and WOWA

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)