Compromise Programming

Compromise Programming is a multi-objective optimization method that belongs to the class of distance-based approaches, distinguished by its pursuit of a solution that minimizes the deviation from an ideal point across multiple criteria, typically using weighted or norm-based measures to identify the closest feasible compromise.

171

Publications

7.6K

Citations

389

Authors

211

Institutions

Publications per year

2017–2026

45

Authors

389

  1. CR
    Carlos Romero

    Universidad Politécnica de Madrid, Spain

    13 publications · 673 citations

    12

    h-index

  2. LD
    Lucien Duckstein

    University of Arizona, United States

    9 publications · 1.3K citations

    9

    h-index

  3. EB
    Enrique Ballestero

    Universidad Politécnica de Madrid, Spain

    7 publications · 314 citations

    7

    h-index

  4. AT
    Aregai Tecle

    Northern Arizona University, United States

    4 publications · 152 citations

    4

    h-index

  5. NT
    Ngo Tung Son

    FPT University, Vietnam

    4 publications · 85 citations

    4

    h-index

1–5 of 389

Venues

  1. European Journal of Operational Research

    5 publications · 306 citations

    5

    h-index

  2. Journal of the Operational Research Society

    OR · 5 publications · 298 citations

    5

    h-index

  3. 5

    h-index

  4. Applied Mathematics and Computation

    5 publications · 240 citations

    5

    h-index

  5. 4

    h-index

1–5