Multi-objective Combinatorial Optimization
Multi-Objective Combinatorial Optimization is a subfield of mathematical optimization that addresses decision-making problems involving the simultaneous optimization of multiple conflicting objectives over discrete solution spaces, where solutions are typically characterized by combinatorial structures such as permutations, subsets, or graphs.
992
Publications
57.2K
Citations
2.4K
Authors
1K
Institutions
Publications per year
2017–2026
404
Variants
Moco
Parents
992
Metaheuristics in combinatorial optimization
Christian Blum, Andrea Roli · ACM Computing Surveys · 2003 · 3.1K citations
Metaheuristics in Combinatorial Optimization
Michel Gendreau, Jean‐Yves Potvin · Annals of Operations Research · 2005 · 2.3K citations
1–5 of 992
2.4K
13
h-index
12
h-index
Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico
11 publications · 300 citations
11
h-index
11
h-index
10
h-index
1–5 of 2.4K
1K

Centre National de la Recherche Scientifique
Paris, France
22 h-index
75 publications
3.6K citations

Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional
Mexico City, Mexico
14 h-index
21 publications
580 citations
Middle East Technical University
Ankara, Türkiye
12 h-index
18 publications
671 citations

University of Tehran
Tehran, Iran
12 h-index
31 publications
849 citations

Universidad de Málaga
Málaga, Spain
12 h-index
31 publications
1.1K citations

Xidian University
Xi'an, China
12 h-index
38 publications
2K citations

Northeastern University
Shenyang, China
11 h-index
26 publications
762 citations
National University of Singapore
Singapore, Singapore
11 h-index
21 publications
589 citations
1–8 of 1K
46 publications · 3.7K citations
30
h-index
34 publications · 2.1K citations
24
h-index
28 publications · 1.4K citations
22
h-index
27 publications · 1.4K citations
22
h-index
19 publications · 1.3K citations
17
h-index
1–5