Results 301 to 310 of about 188,484 (320)
Some of the next articles are maybe not open access.

On the approximation of a pareto set

USSR Computational Mathematics and Mathematical Physics, 1984
The problem is to determine the Pareto set related to \(''\max ''_{x\in X}f\), \(f=(f_ 1,...,f_ m)\), \(X\subseteq {\mathbb{R}}^ n\) compact feasible solution set, \(Y=f(X)=\{y\in {\mathbb{R}}^ m|\) \(y=f(x)\), \(x\in X\}\). Let \(V\subseteq {\mathbb{R}}^ m\) be any set.
openaire   +3 more sources

Almost-Pareto Decision Sets in Imprecise Utility Hierarchies

Journal of Statistical Theory and Practice, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Farrow M, Goldstein M
openaire   +3 more sources

Dynamic algorithm selection for pareto optimal set approximation

Journal of Global Optimization, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Steponavičė, Ingrida   +3 more
openaire   +2 more sources

Relation between Pareto-Optimal Fuzzy Rules and Pareto-Optimal Fuzzy Rule Sets

2007 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making, 2007
Evolutionary multiobjective optimization (EMO) has been utilized in the field of data mining in the following two ways: to find Pareto-optimal rules and Pareto-optimal rule sets. Confidence and coverage are often used as two objectives to evaluate each rule in the search for Pareto-optimal rules.
Hisao Ishibuchi   +2 more
openaire   +1 more source

Reducing the Pareto set based on set-point information

Scientific and Technical Information Processing, 2011
An axiomatic approach to reducing the Pareto set in the problem of multicriteria choice based on an information set obtained from the decision maker is considered. The information reflects the degree up to which the decision maker is ready to lose values of one group of criteria to improve values of several other groups of criteria.
openaire   +1 more source

Strengthened Pareto Equilibrium for Games on Intersecting Sets*

Cybernetics and Systems Analysis, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Non-Convexifiable Pareto Sets

Econometrica, 1978
Kannai, Yakar, Mantel, Rolf
openaire   +2 more sources

Small Approximate Pareto Sets with Quality Bounds

2023
We present and empirically characterize a general, parallel, heuristic algorithm for computing small ε-Pareto sets. The algorithm can be used as part of a decision support tool for settings in which computing points in objective space is computationally expensive. We use the graph clearing problem, a formalization of indirect organ exchange markets, as
openaire   +1 more source

Pareto bordered sets

Optimization, 2023
openaire   +1 more source

Fuzzy programming and the Pareto optimal set

Fuzzy Sets and Systems, 1983
It is shown how fuzzy programming, using either the min or product operator, may be used to generate the whole Pareto optimal set for nonlinear concave, or convex, multiobjective programming problems. Also, a new solution procedure for a fuzzy program, when the min operator is employed, is presented.
openaire   +2 more sources

Home - About - Disclaimer - Privacy