Exact Algorithms
Exact Algorithms is a computational method within geometric optimization that belongs to the class of algorithmic approaches designed to solve optimization problems by guaranteeing globally optimal solutions, distinguished from approximate or heuristic methods by its ability to achieve precision without solution error.
989
Publications
61.3K
Citations
2.2K
Authors
927
Institutions
Publications per year
2017–2026
219
989
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
Marius Muja, David Lowe · 2009 · 2.6K citations · Full text
Fifty Years of Vehicle Routing
Gilbert Laporte · Transportation Science · 2009 · 981 citations
1–5 of 989
2.2K
15
h-index
11
h-index
10
h-index
10
h-index
9
h-index
1–5 of 2.2K
927
University of Bergen
Bergen, Norway
18 h-index
34 publications
2.5K citations
Carnegie Mellon University
Pittsburgh, United States
16 h-index
27 publications
4.2K citations

Centre National de la Recherche Scientifique
Paris, France
16 h-index
39 publications
2.6K citations

University of Bologna
Bologna, Italy
16 h-index
31 publications
4.8K citations
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
26 publications
1.7K citations
HEC Montréal
Montreal, Canada
14 h-index
25 publications
4.9K citations
University of Illinois Urbana-Champaign
Urbana, United States
13 h-index
25 publications
2.3K citations
Utrecht University
Utrecht, The Netherlands
13 h-index
24 publications
1.4K citations
1–8 of 927
40 publications · 3.7K citations
24
h-index
26 publications · 1.4K citations
21
h-index
29 publications · 2.4K citations
19
h-index
18 publications · 2.3K citations
17
h-index
Repository · 28 publications · 1.1K citations
16
h-index
1–5