State Space Search
State Space Search is a computational problem-solving paradigm within algorithmic design that systematically explores the set of all possible configurations (states) of a problem instance, distinguished by its use of recursive traversal and pruning strategies to identify valid solutions among the states.
367
Publications
19.1K
Citations
753
Authors
324
Institutions
Publications per year
2017–2026
58
367
An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
Yvan Dumas, Jacques Desrosiers, Éric Gélinas et al. · Operations Research · 1995 · 340 citations
1–5 of 367
753
11
h-index
10
h-index
9
h-index
9
h-index
7
h-index
1–5 of 753
324

University of Alberta
Edmonton, Canada
17 h-index
44 publications
2.1K citations
Ben-Gurion University of the Negev
Beersheba, Israel
14 h-index
21 publications
1.2K citations
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
17 publications
413 citations

Saarland University
Saarbrücken, Germany
10 h-index
23 publications
474 citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
19 publications
718 citations

Australian National University
Canberra, Australia
7 h-index
13 publications
351 citations
University of Southern California
Los Angeles, United States
7 h-index
22 publications
581 citations
University of Toledo
Toledo, United States
7 h-index
22 publications
523 citations
1–8 of 324
Conference · 14 publications · 376 citations
12
h-index
14 publications · 340 citations
11
h-index
10 publications · 414 citations
10
h-index
JAIR · 8 publications · 2.3K citations
8
h-index
Repository · 7 publications · 345 citations
7
h-index
1–5