Decomposition-Based Optimization is a multi-objective optimization approach that decomposes a complex problem into multiple simpler subproblems through scalarization techniques, enabling the simultaneous optimization of conflicting objectives by coordinating solutions across subproblems.
999
Publications
58.3K
Citations
2.4K
Authors
855
Institutions
Publications per year
2017–2026
363
Parents
Publications
999
Decomposition Principle for Linear Programs
George B. Dantzig, Philip Wolfe · Operations Research · 1960 · 2.3K citations
1–5 of 999
Authors
2.4K
- QZ
22
h-index
- XY
16
h-index
- PY
15
h-index
- XL
13
h-index
- CACarlos A. Coello Coello
Centro de Investigación y de Estudios Avanzados del Instituto Politécnico Nacional, Mexico
14 publications · 629 citations
13
h-index
1–5 of 2.4K
Institutions
855
City University of Hong Kong
Hong Kong, Hong Kong
25 h-index
44 publications
8.4K citations
Xidian University
Xi'an, China
21 h-index
100 publications
5.2K citations
Carnegie Mellon University
Pittsburgh, United States
18 h-index
46 publications
2.7K citations
Stanford University
Stanford, United States
17 h-index
24 publications
2.1K citations
University of Michigan
Ann Arbor, United States
16 h-index
48 publications
1.7K citations
Shenzhen University
Shenzhen, China
15 h-index
62 publications
2.3K citations
Langley Research Center
Hampton, United States
15 h-index
22 publications
3K citations
South China University of Technology
Guangzhou, China
15 h-index
33 publications
1.6K citations
1–8 of 855
Venues
- IEEE Transactions on Evolutionary Computation
42 publications · 7.7K citations
33
h-index
- IEEE Transactions on Cybernetics
27 publications · 2.3K citations
24
h-index
- IEEE Transactions on Power Systems
23 publications · 1.7K citations
23
h-index
- Information Sciences
19 publications · 703 citations
17
h-index
- Computers & Chemical Engineering
20 publications · 849 citations
16
h-index
1–5