Graph Optimization
Graph Optimization is a discrete optimization problem that involves finding an optimal configuration or structure within a graph, distinguished by its focus on optimizing objective functions defined over vertices, edges, or subgraphs subject to combinatorial constraints.
1.1K
Publications
70.2K
Citations
2.9K
Authors
927
Institutions
Publications per year
2017–2026
404
Parents
1.1K
Learning Combinatorial Optimization Algorithms over Graphs
Hanjun Dai, Elias B. Khalil, Yuyu Zhang et al. · arXiv (Cornell University) · 2017 · 977 citations · Full text
1–5 of 1.1K
2.9K
8
h-index
7
h-index
7
h-index
7
h-index
7
h-index
1–5 of 2.9K
927
Carnegie Mellon University
Pittsburgh, United States
20 h-index
48 publications
3.5K citations

Chinese Academy of Sciences
Beijing, China
19 h-index
52 publications
3.2K citations
University of California, Berkeley
Berkeley, United States
18 h-index
32 publications
3.2K citations

Centre National de la Recherche Scientifique
Paris, France
17 h-index
36 publications
1.6K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
17 h-index
47 publications
1.7K citations
Massachusetts Institute of Technology
Cambridge, United States
15 h-index
43 publications
2.6K citations
Tsinghua University
Beijing, China
15 h-index
42 publications
2.2K citations
Georgia Institute of Technology
Atlanta, United States
14 h-index
29 publications
8.1K citations
1–8 of 927
Repository · 45 publications · 2.8K citations
21
h-index
32 publications · 1.9K citations
21
h-index
19 publications · 691 citations
15
h-index
TPAMI · 15 publications · 2.3K citations
15
h-index
18 publications · 870 citations
15
h-index
1–5