Combinatorial Search is a systematic computational method for exploring a discrete solution space by generating and testing candidate solutions according to constraints, distinguished from other search strategies by its focus on enumerating configurations drawn from combinatorial structures such as permutations, subsets, or tuples.
1.2K
Publications
110K
Citations
2.6K
Authors
960
Institutions
Publications per year
2017–2026
201
Parents
Publications
1.2K
Fred Glover · INFORMS Journal on Computing · 1990 · 5.6K citations
Fred Glover · INFORMS Journal on Computing · 1989 · 5K citations
Matthew W. Moskewicz, Conor Madigan, Ying Zhao et al. · 2001 · 2.9K citations
1–5 of 1.2K
Authors
2.6K
- JH
12
h-index
- CJ
10
h-index
- CP
9
h-index
- FG
7
h-index
- PV
7
h-index
1–5 of 2.6K
Institutions
960
Massachusetts Institute of Technology
Cambridge, United States
20 h-index
50 publications
16.8K citations
University of California, Berkeley
Berkeley, United States
17 h-index
42 publications
7.7K citations
Centre National de la Recherche Scientifique
Paris, France
16 h-index
39 publications
1.7K citations
Université d'Angers
Angers, France
13 h-index
22 publications
898 citations
Stanford University
Stanford, United States
12 h-index
21 publications
1.7K citations
Cornell University
Ithaca, United States
12 h-index
26 publications
2.2K citations
Carnegie Mellon University
Pittsburgh, United States
11 h-index
15 publications
1.6K citations
Arizona State University
Tempe, United States
11 h-index
20 publications
1.1K citations
1–8 of 960
Venues
- European Journal of Operational Research
29 publications · 2.2K citations
23
h-index
- arXiv (Cornell University)
Repository · 26 publications · 861 citations
16
h-index
- Computers & Operations Research
17 publications · 1.2K citations
15
h-index
- Discrete Mathematics
17 publications · 1.3K citations
14
h-index
- Proceedings of the AAAI Conference on Artificial Intelligence
Conference · 15 publications · 770 citations
13
h-index
1–5