Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Adam Kasperski, Pawel Zielinski. Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion. In Stefan Helber, Michael H. Breitner, Daniel Rösch, Cornelia Schön, Johann-Matthias Graf von der Schulenburg, Philipp Sibbertsen, Marc C. Steinbach, Stefan Weber, Anja Wolter, editors, Operations Research Proceedings 2012, Selected Papers of the International Annual Conference of the German Operations Research Society (GOR), Leibniz University of Hannover, Germany, September 5-7, 2012. pages 141-146, Springer, 2012. [doi]

The following publications are possibly variants of this publication:

Combinatorial optimization problems with uncertain costs and the OWA criterionAdam Kasperski, Pawel Zielinski. TCS, 565:102-112, 2015. [doi]

Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterionAdam Kasperski, Pawel Zielinski. orl, 41(6):639-643, 2013. [doi]

On combinatorial optimization problems on matroids with uncertain weightsAdam Kasperski, Pawel Zielinski. eor, 177(2):851-864, 2007. [doi]

Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy CostsAdam Kasperski, Pawel Zielinski. fuzzIEEE 2007: 1-6 [doi]

Sequencing Problems with Uncertain Parameters and the OWA CriterionAdam Kasperski, Pawel Zielinski. or 2014: 223-229 [doi]

Approximating combinatorial optimization problems with the ordered weighted averaging criterionAndré B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski 0001. eor, 286(3):828-838, 2020. [doi]

Single machine scheduling problems with uncertain parameters and the OWA criterionAdam Kasperski, Pawel Zielinski. scheduling, 19(2):177-190, 2016. [doi]

runs on WebDSL