The p-Hub Location Problem is a combinatorial optimization problem in location theory that involves selecting exactly p hubs from a set of nodes in a network and allocating non-hub nodes to these hubs in order to minimize the total transportation cost, distinguished from other hub location problems by the strict constraint on the number of hubs to be established.
49
Publications
2.8K
Citations
108
Authors
83
Institutions
Publications per year
2017–2026
15
Variants
P-hub Median Problem
Parents
Publications
49
1–5 of 49
Authors
108
- RT
4
h-index
- AE
2
h-index
- MB
2
h-index
- ZQ
2
h-index
- VM
2
h-index
1–5 of 108
Institutions
83
Beihang University
Beijing, China
3 h-index
6 publications
259 citations
University of Tehran
Tehran, Iran
3 h-index
8 publications
485 citations
The Ohio State University
Columbus, United States
2 h-index
2 publications
180 citations
Universidad de La Laguna
San Cristóbal de La Laguna, Spain
2 h-index
6 publications
138 citations
Monash University
Melbourne, Australia
2 h-index
3 publications
139 citations
Beijing Jiaotong University
Beijing, China
2 h-index
2 publications
95 citations
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
459 citations
Pontificia Universidad Católica de Chile
Santiago, Chile
2 h-index
3 publications
320 citations
1–8 of 83
Venues
- European Journal of Operational Research
4 publications · 481 citations
4
h-index
- International Transactions in Operational Research
3 publications · 41 citations
3
h-index
- Applied Mathematical Modelling
3 publications · 219 citations
3
h-index
- Computers & Industrial Engineering
3 publications · 150 citations
3
h-index
- Transportation Science
2 publications · 88 citations
2
h-index
1–5