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
Parents
317
Wayne S. DeSarbo, C. Anthony Di Benedetto, Michael Song et al. · Strategic Management Journal · 2004 · 904 citations
1–5 of 317
821
7
h-index
7
h-index
6
h-index
6
h-index
6
h-index
1–5 of 821
429

Centre National de la Recherche Scientifique
Paris, France
14 h-index
29 publications
2.4K citations

Pennsylvania State University
State College, United States
7 h-index
8 publications
1.1K citations
Middle East Technical University
Ankara, Türkiye
7 h-index
10 publications
579 citations
University of Mons
Mons, Belgium
7 h-index
19 publications
2.8K citations

Universidad de Málaga
Málaga, Spain
6 h-index
13 publications
454 citations

Nanjing University of Aeronautics and Astronautics
Nanjing, China
6 h-index
20 publications
898 citations

City University of Hong Kong
Hong Kong, Hong Kong
6 h-index
8 publications
485 citations
Université de Lille
Lille, France
6 h-index
10 publications
639 citations
1–8 of 429
19 publications · 1.5K citations
18
h-index
12 publications · 441 citations
11
h-index
8 publications · 744 citations
8
h-index
7 publications · 1.6K citations
7
h-index
6 publications · 583 citations
6
h-index
1–5