A 2-phase algorithm for solving the single allocation p-hub center problem
From MaRDI portal
A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
Recommendations
- The \(p\)-hub center allocation problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Solving large single allocation p-hub problems with two or three hubs
- Heuristic algorithms for the single allocation p-hub center problem with routing considerations
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
Cites work
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
- Ant colony optimization.
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- Integer programming formulations of discrete hub location problems
- Network hub location problems: The state of the art
- On the single-assignment \(p\)-hub center problem
- The \(p\)-hub center allocation problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
Cited in
(36)- Uncapacitated single and multiple allocation \(p\)-hub center problems
- On the single-assignment \(p\)-hub center problem
- Solving large single allocation p-hub problems with two or three hubs
- Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
- A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem
- Novel formulations and VNS-based heuristics for single and multiple allocation p-hub maximal covering problems
- HUBBI: iterative network design for incomplete hub location problems
- Heuristic algorithms for the single allocation p-hub center problem with routing considerations
- Star p-hub center problem and star p-hub median problem with bounded path lengths
- A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming
- Improved hardness and approximation results for single allocation hub location
- An efficient heuristic for a hub location routing problem
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
- A non-triangular hub location problem
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Improved hardness and approximation results for single allocation hub location problems
- Mathematical formulations and solution methods for the uncapacitated r-allocation p-hub maximal covering problem
- Approximation algorithms for the star k-hub center problem in metric graphs
- Multimodal freight transportation planning: a literature review
- GRASP for the uncapacitated r-allocation p-hub median problem
- Algorithms for solving the hub construction problem with given number of hub nodes
- Solving the uncapacitated single allocation p-hub Median problem on GPU
- A basic variable neighborhood search heuristic for the uncapacitated multiple allocation \(p\)-hub center problem
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
- The p-hub centre routing problem with emissions budget: formulation and solution procedure
- The classical p-median problem as a surrogate model in hub location
- Team formation based on group technology: a hybrid grouping genetic algorithm approach
- Single-allocation ordered median hub location problems
- Solution approaches for the uncapacitated r-allocation p-hub center problem
- Mathematical model and hybrid meta-heuristic solution approaches for hub location problem with hybrid drone-airplane delivery mode
- Reinforcement learning-driven dynamic threshold search for the uncapacitated r-allocation p-hub center problem
- Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem
- Aggregation in hub location problems
- The \(p\)-hub center allocation problem
- A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem
This page was built for publication: A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q833530)
