Models and solution methods for the uncapacitated r-allocation p-hub equitable center problem
From MaRDI portal
Publication:5374519
Recommendations
- Allocation strategies in hub networks
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- The \(p\)-hub center allocation problem
- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
Cited in
(9)- Modeling and solving the uncapacitated \(r\)-allocation \(p\)-hub median problem under congestion
- Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
- Allocating nodes to hubs for minimizing the hubs processing resources: A case study
- The uncapacitated r‐allocation p‐hub center problem
- On hub location problems in geographically flexible networks
- General variable neighborhood search for the capacitated single allocation hub maximal covering problem
- Solution approaches for the uncapacitated r-allocation p-hub center problem
- Modeling fuzzy capacitated p-hub center problem and a genetic algorithm solution
- Reinforcement learning-driven dynamic threshold search for the uncapacitated r-allocation p-hub center problem
This page was built for publication: Models and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub equitable center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5374519)