![Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery - ScienceDirect Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery - ScienceDirect](https://ars.els-cdn.com/content/image/1-s2.0-S1366554517300376-gr1.jpg)
Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery - ScienceDirect
![PDF) New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem | Sebastián Urrutia - Academia.edu PDF) New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem | Sebastián Urrutia - Academia.edu](https://0.academia-photos.com/attachment_thumbnails/78127976/mini_magick20220105-27184-1b73aoe.png?1641395247)
PDF) New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem | Sebastián Urrutia - Academia.edu
![PDF] Solving uncapacitated multiple allocation p-hub center problem by Dijkstra's algorithm-based genetic algorithm and simulated annealing | Semantic Scholar PDF] Solving uncapacitated multiple allocation p-hub center problem by Dijkstra's algorithm-based genetic algorithm and simulated annealing | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/04b0c65f9f19163f22a3adcac9c100a03c8871cf/4-Table1-1.png)
PDF] Solving uncapacitated multiple allocation p-hub center problem by Dijkstra's algorithm-based genetic algorithm and simulated annealing | Semantic Scholar
![A single allocation p-hub median problem with general piecewise-linear costs in arcs - ScienceDirect A single allocation p-hub median problem with general piecewise-linear costs in arcs - ScienceDirect](https://ars.els-cdn.com/content/image/1-s2.0-S0360835218306612-gr2.jpg)
A single allocation p-hub median problem with general piecewise-linear costs in arcs - ScienceDirect
![An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty - ScienceDirect An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty - ScienceDirect](https://ars.els-cdn.com/content/image/1-s2.0-S0305054818301126-gr1.jpg)
An efficient matheuristic for the robust multiple allocation p-hub median problem under polyhedral demand uncertainty - ScienceDirect
![Solving the Uncapacitated Single Allocation p-Hub Location Problem with Fixed Cost Using Anti-Predatory NIA | Bentham Science Solving the Uncapacitated Single Allocation p-Hub Location Problem with Fixed Cost Using Anti-Predatory NIA | Bentham Science](https://www.eurekaselect.com/images/graphical-abstract/racsc/14/7/019.jpg)
Solving the Uncapacitated Single Allocation p-Hub Location Problem with Fixed Cost Using Anti-Predatory NIA | Bentham Science
The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach
![PDF] Solving uncapacitated multiple allocation p-hub center problem by Dijkstra's algorithm-based genetic algorithm and simulated annealing | Semantic Scholar PDF] Solving uncapacitated multiple allocation p-hub center problem by Dijkstra's algorithm-based genetic algorithm and simulated annealing | Semantic Scholar](https://d3i71xaburhd42.cloudfront.net/04b0c65f9f19163f22a3adcac9c100a03c8871cf/2-Figure1-1.png)
PDF] Solving uncapacitated multiple allocation p-hub center problem by Dijkstra's algorithm-based genetic algorithm and simulated annealing | Semantic Scholar
![A Hierarchical Approach to the Capacitated Single Allocation p-Hub Median Problem with Direct Shipment | Scientific.Net A Hierarchical Approach to the Capacitated Single Allocation p-Hub Median Problem with Direct Shipment | Scientific.Net](https://www.scientific.net/AMM.209-211.807/preview.gif)
A Hierarchical Approach to the Capacitated Single Allocation p-Hub Median Problem with Direct Shipment | Scientific.Net
![The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach | SpringerLink The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach | SpringerLink](https://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs13676-019-00141-w/MediaObjects/13676_2019_141_Figa_HTML.png)
The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach | SpringerLink
An Estimated Formulation for the Capacitated Single Allocation p-hub Median Problem with Fixed Costs of Opening Facilities
![The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach | SpringerLink The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach | SpringerLink](https://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs13676-019-00141-w/MediaObjects/13676_2019_141_Figb_HTML.png)
The capacitated single-allocation p-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach | SpringerLink
![Heuristic algorithms for the single allocation p-hub center problem with routing considerations | springerprofessional.de Heuristic algorithms for the single allocation p-hub center problem with routing considerations | springerprofessional.de](https://media.springernature.com/lw400/springer-static/cover/journal/291/41/1.jpg?as=jpg)
Heuristic algorithms for the single allocation p-hub center problem with routing considerations | springerprofessional.de
![A single allocation hub location network (see online version for colours) | Download Scientific Diagram A single allocation hub location network (see online version for colours) | Download Scientific Diagram](https://www.researchgate.net/publication/260002227/figure/fig1/AS:340462712967168@1458184044049/A-single-allocation-hub-location-network-see-online-version-for-colours.png)