Results 11 to 20 of about 5,005,250 (153)
, 2023 In bi-criteria optimization problems, the goal is typically to compute the set of Pareto-optimal solutions. Many algorithms for these types of problems rely on efficient merging or combining of partial solutions and filtering of dominated solutions in the resulting sets.
Demian Hespe +3 more
openaire +4 more sources
One-exact approximate Pareto sets [PDF]
Journal of Global Optimization, 2020 AbstractPapadimitriou and Yannakakis (Proceedings of the 41st annual IEEE symposium on the Foundations of Computer Science (FOCS), pp 86–92, 2000) show that the polynomial-time solvability of a certain auxiliary problem determines the class of multiobjective optimization problems that admit a polynomial-time computable $$(1+\varepsilon , \dots , 1 ...
Arne Herzel +4 more
openaire +5 more sources
Pareto Front Shape-Agnostic Pareto Set Learning in Multi-Objective Optimization [PDF]
2024 IEEE International Conference on Systems, Man, and Cybernetics (SMC)Pareto set learning (PSL) is an emerging approach for acquiring the complete Pareto set of a multi-objective optimization problem. Existing methods primarily rely on the mapping of preference vectors in the objective space to Pareto optimal solutions in the decision space.
Rongguang Ye +4 more
core +5 more sources
Computing the set of Epsilon-efficient solutions in multiobjective space mission design [PDF]
, 2011 In this work, we consider multiobjective space mission design problems. We will start from the need, from a practical point of view, to consider in addition to the (Pareto) optimal solutions also nearly optimal ones.
Vasile, Massimiliano +2 more
core +4 more sources
Beliefs and Pareto Efficient Sets: A Remark [PDF]
Journal of Economic Theory, 2002 We show that, in a two-period economy with uncertainty in the second period, if an allocation is Pareto optimal for a given set of beliefs and remains optimal when these beliefs are changed, then the set of optimal allocations of the two economies must actually coincide.
Gajdos Preuss, Thibault +1 more
openaire +4 more sources
A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization [PDF]
, 2009 A method is presented for generating a well-distributed Pareto set in nonlinear multiobjective optimization. The approach shares conceptual similarity with the Physical Programming-based method, the Normal-Boundary Intersection and the Normal ...
Utyuzhnikov, S.V.; id_orcid +7 more
core +1 more source
Approximating Pareto frontier using a hybrid line search approach [PDF]
, 2010 This is the post-print version of the final paper published in Information Sciences. The published article is available from the link below. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting ...
Abraham, A, Grosan, C
core +1 more source
Pareto-optimized solution set under essential maintenance strategy at 2-inspection maintenance.
, 2023 Pareto-optimized solution set under essential maintenance strategy at 2-inspection maintenance.
Chengjie Rao (16884149) +4 more
core +1 more source
On the hierarchical structure of Pareto critical sets [PDF]
Journal of Global Optimization, 2019 In this article we show that the boundary of the Pareto critical set of an unconstrained multiobjective optimization problem (MOP) consists of Pareto critical points of subproblems considering subsets of the objective functions. If the Pareto critical set is completely described by its boundary (e.g.
Bennet Gebken +2 more
openaire +4 more sources
Pareto-optimized solution set under preventive maintenance strategy at 1-inspection maintenance.
, 2023 Pareto-optimized solution set under preventive maintenance strategy at 1-inspection maintenance.
Chengjie Rao (16884149) +4 more
core +1 more source