Discrete Location Problem
A Discrete Location Problem is a location optimization problem in which the set of potential facility sites is finite and explicitly predefined, distinguishing it from continuous or network location problems where sites may be chosen anywhere within a continuous space or along a network.
633
Publications
39.1K
Citations
1.2K
Authors
557
Institutions
Publications per year
2017–2026
119
Variants
Discrete Facility Location Problem
Parents
633
ANALYZING ANIMAL MOVEMENTS USING BROWNIAN BRIDGES
Jon S. Horne, Edward O. Garton, Stephen M. Krone et al. · Ecology · 2007 · 949 citations
Life Sciences, Ecology, Zoology +14
1–5 of 633
1.2K
15
h-index
14
h-index
12
h-index
11
h-index
10
h-index
1–5 of 1.2K
557

Universidad de Sevilla
Seville, Spain
17 h-index
37 publications
1.2K citations

University of Toronto
Toronto, Canada
16 h-index
27 publications
1.5K citations

Johns Hopkins University
Baltimore, United States
13 h-index
22 publications
3.3K citations

California State University, Fullerton
Fullerton, United States
12 h-index
14 publications
740 citations
University of Florida
Gainesville, United States
12 h-index
18 publications
1.2K citations

Tel Aviv University
Tel Aviv, Israel
11 h-index
14 publications
581 citations
Northwestern University
Evanston, United States
10 h-index
12 publications
1.5K citations
Amirkabir University of Technology
Tehran, Iran
10 h-index
21 publications
2.3K citations
1–8 of 557
56 publications · 6.1K citations
32
h-index
39 publications · 2.5K citations
27
h-index
OR · 26 publications · 2.6K citations
21
h-index
26 publications · 3.1K citations
21
h-index
20 publications · 645 citations
16
h-index
1–5