Robust min-max (regret) optimization using ordered weighted averaging
From MaRDI portal
Cites work
- A Preference Elicitation Approach for the Ordered Weighted Averaging Criterion using Solution Choice Observations
- Algorithms and uncertainty sets for data-driven robust shortest path problems
- Alternative formulations for the ordered weighted averaging objective
- An overview of methods for determining OWA weights
- Analytic Inequalities
- Approximating combinatorial optimization problems with the ordered weighted averaging criterion
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems
- Approximation algorithms for minimum norm and ordered optimization problems
- Combinatorial optimization problems with uncertain costs and the OWA criterion
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- Data-driven robust optimization using deep neural networks
- Dependent randomized rounding via exchange properties of combinatorial structures
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- How well does the OWA operator represent real preferences?
- scientific article; zbMATH DE number 6009887 (Why is no real title available?)
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3947944 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 3434895 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- Introduction to stochastic programming.
- Matroids and the greedy algorithm
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Network flows. Theory, algorithms, and applications.
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- On solving linear programs with the ordered weighted averaging objective.
- On the approximability of minmax (regret) network optimization problems
- On the approximability of robust spanning tree problems
- Ordered weighted average combinatorial optimization: formulations and their properties
- Reference points and approximation algorithms in multicriteria discrete optimization
- Robust discrete optimization and its applications
- Simple greedy algorithms for fundamental multidimensional graph problems
- Some remarks on the value-at-risk and the conditional value-at-risk
- The Minimum Satisfiability Problem
- The weighted OWA operator
- Using the WOWA operator in robust discrete optimization problems
This page was built for publication: Robust min-max (regret) optimization using ordered weighted averaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982103)
