Results 11 to 20 of about 188,484 (320)
Approximating the Pareto set [PDF]
, 2001 This paper adresses the problem of diversity in multiobjective evolutionary algorithms and its implications for the quality of the approximated set of efficient solutions (Pareto set).
Laumanns, Marco +2 more
core +3 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 ...
Jean-Marc Tallon, Thibault Gajdos
core +5 more sources
Evolved GANs for generating pareto set approximations
Proceedings of the Genetic and Evolutionary Computation Conference, 2018 Basque Government: IT-609-13, Spanish Ministry of Economy, Industry and Competitiveness: TIN2016-78365-R, University of the Basque Country: PIF16 ...
Unai Garciarena +2 more
openalex +3 more sources
Recursive Contracts, Lotteries and Weakly Concave Pareto Sets [PDF]
Review of Economic Dynamics, 2012 Marcet and Marimon (1994, revised 1998) developed a recursive saddle point method which can be used to solve dynamic contracting problems that include participation, enforcement and incentive constraints. Their method uses a recursive multiplier to capture implicit prior promises to the agent(s) that were made in order to satisfy earlier instances of ...
Harold L. Cole, Felix Kübler
openalex +4 more sources
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms [PDF]
AlgorithmicaAbstract 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.
Daniel Funke +4 more
openalex +6 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
, 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.
Hespe, Demian +7 more
openaire +4 more sources
Heat transfer enhancement in micro heat exchangers using genetic algorithm based multi-objective optimization [PDF]
مجله مدل سازی در مهندسی, 2019 In this study, the optimization of heat transfer in serpentine micro heat exchangers using the genetic algorithm based multi-objective optimization was investigated.
Reza Beigzadeh
doaj +1 more source
Data-driven analysis of pareto set topology [PDF]
Proceedings of the Genetic and Evolutionary Computation Conference, 2018 8 pages, accepted at GECCO'18 as a full ...
Hamada, Naoki, Goto, Keisuke
openaire +2 more sources
ON PARETO SET FOR A BI-CRITERIA SINGLE MACHINE SCHEDULING PROBLEM
Tikrit Journal of Pure Science, 2023 This paper considers a bi-criteria planning problems on a single machine, with the goal of minimizing total square time duration and maximizing earliness. To solve this problem we have to find the Pareto set.
Rzgar F. Mahmood +3 more
doaj +1 more source