Constraint-based Optimization
Constraint-Based Optimization is a mathematical optimization approach that identifies optimal solutions within a feasible region defined by a set of equality and inequality constraints, distinguishing itself from unconstrained methods by explicitly incorporating domain-specific limitations into the optimization process.
977
Publications
56.7K
Citations
2.2K
Authors
932
Institutions
Publications per year
2017–2026
183
977
1–5 of 977
2.2K
9
h-index
7
h-index
6
h-index
6
h-index
5
h-index
1–5 of 2.2K
932
Carnegie Mellon University
Pittsburgh, United States
18 h-index
44 publications
2.1K citations

Centre National de la Recherche Scientifique
Paris, France
17 h-index
42 publications
2.2K citations

Imperial College London
London, United Kingdom
13 h-index
25 publications
1K citations
University of California, Berkeley
Berkeley, United States
13 h-index
28 publications
1.5K citations

UNSW Sydney
Sydney, Australia
12 h-index
22 publications
986 citations
Tsinghua University
Beijing, China
11 h-index
22 publications
913 citations

University of Bologna
Bologna, Italy
11 h-index
21 publications
610 citations
Nanyang Technological University
Singapore, Singapore
10 h-index
18 publications
2.9K citations
1–8 of 932
38 publications · 2.5K citations
28
h-index
32 publications · 860 citations
20
h-index
28 publications · 734 citations
18
h-index
14 publications · 442 citations
13
h-index
15 publications · 635 citations
13
h-index
1–5