![The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach - ScienceDirect The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach - ScienceDirect](https://ars.els-cdn.com/content/image/1-s2.0-S2192437620300388-gr1.jpg)
The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach - ScienceDirect
![Typical hub-and-spoke networks: a single allocation; b multiple allocation | Download Scientific Diagram Typical hub-and-spoke networks: a single allocation; b multiple allocation | Download Scientific Diagram](https://www.researchgate.net/publication/270824044/figure/fig1/AS:613984214450211@1523396652651/Typical-hub-and-spoke-networks-a-single-allocation-b-multiple-allocation.png)
Typical hub-and-spoke networks: a single allocation; b multiple allocation | Download Scientific Diagram
![A literature survey of HUB location problems and methods with emphasis on the marine transportations | Semantic Scholar A literature survey of HUB location problems and methods with emphasis on the marine transportations | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/5dc9bb344d687350083e2628c2837c71adc50eea/2-Figure1-1.png)
A literature survey of HUB location problems and methods with emphasis on the marine transportations | Semantic Scholar
![Capacited P-hub location problem allowing direct flow between spokes in intermodal transportation network | SpringerLink Capacited P-hub location problem allowing direct flow between spokes in intermodal transportation network | SpringerLink](https://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs12046-019-1188-8/MediaObjects/12046_2019_1188_Fig1_HTML.png)