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

Authors

1.2K

  1. ZD
    Zvi Drezner

    California State University, Fullerton, United States

    17 publications · 764 citations

    15

    h-index

  2. OB
    Oded Berman

    University of Toronto, Canada

    14 publications · 807 citations

    14

    h-index

  3. CR
    Charles ReVelle

    Johns Hopkins University, United States

    12 publications · 2.2K citations

    12

    h-index

  4. TJ
    Timothy J. Lowe

    University of Iowa, United States

    11 publications · 779 citations

    11

    h-index

  5. RL
    Richard L. Francis

    University of Florida, United States

    10 publications · 842 citations

    10

    h-index

1–5 of 1.2K

Venues

  1. European Journal of Operational Research

    56 publications · 6.1K citations

    32

    h-index

  2. Computers & Operations Research

    39 publications · 2.5K citations

    27

    h-index

  3. Journal of the Operational Research Society

    OR · 26 publications · 2.6K citations

    21

    h-index

  4. Operations Research

    26 publications · 3.1K citations

    21

    h-index

  5. Computers & Industrial Engineering

    20 publications · 645 citations

    16

    h-index

1–5