Defines the (1,p)-Asymmetric Hub Location Problem with single-origin and multi-destination assignment and proposes a compact three-index integer programming formulation plus valid inequalities that solve efficiently on standard test sets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Hub location problems with asymmetric allocation
Defines the (1,p)-Asymmetric Hub Location Problem with single-origin and multi-destination assignment and proposes a compact three-index integer programming formulation plus valid inequalities that solve efficiently on standard test sets.