Pareto Front Approximation

Pareto Front Approximation is a computational method in multiobjective optimization that generates an estimated set of nondominated solutions approximating the true Pareto front, distinguished by its ability to represent the trade-offs among conflicting objectives when exact analytical solutions are intractable.

495

Publications

30.4K

Citations

1.2K

Authors

519

Institutions

Publications per year

2017–2026

166

Authors

1.2K

  1. CA
    Carlos A. Coello Coello

    Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico

    18 publications · 1.4K citations

    13

    h-index

  2. ME
    Michael Emmerich

    Leiden University, Netherlands

    15 publications · 1.3K citations

    13

    h-index

  3. GG
    Gary G. Yen

    Oklahoma State University, United States

    12 publications · 1.3K citations

    12

    h-index

  4. QZ
    Qingfu Zhang

    City University of Hong Kong, Hong Kong SAR China

    9 publications · 910 citations

    9

    h-index

  5. OS
    Oliver Schütze

    Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico

    9 publications · 328 citations

    9

    h-index

1–5 of 1.2K

Venues

  1. IEEE Transactions on Evolutionary Computation

    33 publications · 4.9K citations

    30

    h-index

  2. IEEE Transactions on Cybernetics

    12 publications · 946 citations

    12

    h-index

  3. Evolutionary Computation

    10 publications · 4.8K citations

    10

    h-index

  4. SIAM Journal on Optimization

    7 publications · 650 citations

    7

    h-index

  5. Proceedings of the Genetic and Evolutionary Computation Conference

    Conference · 7 publications · 269 citations

    7

    h-index

1–5