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
171
1–5 of 171
389
12
h-index
9
h-index
7
h-index
4
h-index
4
h-index
1–5 of 389
211

Universidad Politécnica de Madrid
Madrid, Spain
10 h-index
24 publications
876 citations
University of Arizona
Tucson, United States
8 h-index
11 publications
1K citations

Iran University of Science and Technology
Tehran, Iran
5 h-index
10 publications
141 citations
National Cheng Kung University
Tainan City, Taiwan
4 h-index
8 publications
278 citations

FPT University
Hanoi, Vietnam
3 h-index
6 publications
144 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
3 h-index
4 publications
135 citations
Amirkabir University of Technology
Tehran, Iran
3 h-index
8 publications
456 citations

Universidad de Oviedo
Oviedo, Spain
3 h-index
11 publications
1.2K citations
1–8 of 211
5 publications · 306 citations
5
h-index
OR · 5 publications · 298 citations
5
h-index
5 publications · 141 citations
5
h-index
5 publications · 240 citations
5
h-index
4 publications · 426 citations
4
h-index
1–5