Location-allocation Heuristics
Location-Allocation Heuristics is a systematic computational procedure belonging to the class of optimization methods, distinguished by its use of approximate, iterative strategies to efficiently solve complex spatial resource allocation problems where optimal facility locations and service assignments are determined under constraints.
595
Publications
34.1K
Citations
1.3K
Authors
615
Institutions
Publications per year
2017–2026
147
595
Leon N. Cooper · Operations Research · 1963 · 928 citations
Heuristic Methods for Location-Allocation Problems
Leon N. Cooper · SIAM Review · 1964 · 537 citations
A Branch-Bound Algorithm for Plant Location
M. A. Efroymson, T. L. Ray · Operations Research · 1966 · 426 citations
1–5 of 595
1.3K
12
h-index
8
h-index
7
h-index
6
h-index
5
h-index
1–5 of 1.3K
615
Université de Montréal
Montreal, Canada
11 h-index
23 publications
1.2K citations

California State University, Fullerton
Fullerton, United States
10 h-index
15 publications
679 citations

Beihang University
Beijing, China
10 h-index
25 publications
1.2K citations
Tsinghua University
Beijing, China
9 h-index
19 publications
1.1K citations
HEC Montréal
Montreal, Canada
9 h-index
10 publications
971 citations

University of Toronto
Toronto, Canada
9 h-index
14 publications
691 citations

Indian Institute of Management Ahmedabad
Ahmedabad, India
8 h-index
9 publications
783 citations
Tongji University
Shanghai, China
8 h-index
15 publications
383 citations
1–8 of 615
68 publications · 5K citations
40
h-index
57 publications · 4.1K citations
35
h-index
OR · 33 publications · 1.6K citations
21
h-index
29 publications · 1.4K citations
21
h-index
16 publications · 750 citations
15
h-index
1–5