Multiobjective Combinatorial Optimization

Multiobjective Combinatorial Optimization is a subfield of mathematical optimization that involves the simultaneous minimization or maximization of multiple conflicting objective functions over a discrete set of feasible solutions, where the solution space is combinatorially complex and typically finite.

317

Publications

19.2K

Citations

821

Authors

429

Institutions

Publications per year

2017–2026

94

Variants

Moco

Authors

821

  1. MK
    Murat Köksalan

    Middle East Technical University, Türkiye

    7 publications · 363 citations

    7

    h-index

  2. JT
    Jacques Teghem

    University of Mons, Belgium

    7 publications · 965 citations

    7

    h-index

  3. ME
    Matthias Ehrgott

    University of Auckland, New Zealand

    6 publications · 986 citations

    6

    h-index

  4. AL
    Arnaud Liefooghe

    Centre National de la Recherche Scientifique, France

    6 publications · 381 citations

    6

    h-index

  5. QZ
    Qingfu Zhang

    City University of Hong Kong, Hong Kong SAR China

    6 publications · 1.3K citations

    6

    h-index

1–5 of 821

Venues

  1. European Journal of Operational Research

    19 publications · 1.5K citations

    18

    h-index

  2. Computers & Operations Research

    12 publications · 441 citations

    11

    h-index

  3. IEEE Transactions on Cybernetics

    8 publications · 744 citations

    8

    h-index

  4. Journal of Multi-Criteria Decision Analysis

    7 publications · 1.6K citations

    7

    h-index

  5. Management Science

    6 publications · 583 citations

    6

    h-index

1–5