Hub Covering Problem

The Hub Covering Problem is a location optimization model that belongs to the class of hub location problems, distinguished by its objective to minimize costs while ensuring that all demand points are within a specified coverage distance or time from at least one hub.

36

Publications

1.8K

Citations

76

Authors

37

Institutions

Publications per year

2017–2026

7

Variants

Hub Covering

Authors

76

  1. BY
    Bahar Y. Kara

    Bilkent University, Türkiye

    6 publications · 735 citations

    6

    h-index

  2. RT
    Reza Tavakkoli‐Moghaddam

    University of Tehran, Iran

    6 publications · 234 citations

    6

    h-index

  3. FJ
    Fariborz Jolai

    University of Tehran, Iran

    3 publications · 229 citations

    3

    h-index

  4. SA
    Sibel A. Alumur

    University of Waterloo, Canada

    3 publications · 395 citations

    3

    h-index

  5. OE
    Oya Ekin Karaşan

    Bilkent University, Türkiye

    3 publications · 351 citations

    3

    h-index

1–5 of 76

Venues

  1. European Journal of Operational Research

    3 publications · 125 citations

    3

    h-index

  2. Computers & Industrial Engineering

    3 publications · 140 citations

    3

    h-index

  3. Journal of the Operational Research Society

    OR · 3 publications · 224 citations

    3

    h-index

  4. Scientia Iranica

    2 publications · 89 citations

    2

    h-index

  5. Transportation Research Part B Methodological

    2 publications · 206 citations

    2

    h-index

1–5