Approximating combinatorial optimization problems with uncertain costs and the OWA criterion

DOI10.1007/978-3-319-00795-3_21MaRDI QIDQ5171790zbMATH OpenOpenAlexFDO

Authors Adam Kasperski, Paweł Zieliński

Publication date 12 February 2015

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

Full work available at URL https://doi.org/10.1007/978-3-319-00795-3_21

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Combinatorial optimization problems with uncertain costs and the OWA criterion
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
• Approximating combinatorial optimization problems with the ordered weighted averaging criterion
• Robust discrete optimization problems with the WOWA criterion
• Using the WOWA operator in robust discrete optimization problems

Cited in

(6)

• Approximating combinatorial optimization problems with the ordered weighted averaging criterion
• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
• Robust discrete optimization problems with the WOWA criterion
• Solving linear unconstrained problems of combinatorial optimization on arrangements under stochastic uncertainty
• Combinatorial optimization problems with uncertain costs and the OWA criterion
• Using the WOWA operator in robust discrete optimization problems

This page was built for publication: Approximating combinatorial optimization problems with uncertain costs and the OWA criterion

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