A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
From MaRDI portal
Publication:833530
DOI10.1016/J.COR.2008.07.011zbMath1176.90360OpenAlexW2155887048MaRDI QIDQ833530
Publication date: 14 August 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.07.011
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (27)
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality ⋮ Aggregation in hub location problems ⋮ Multimodal freight transportation planning: a literature review ⋮ On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality ⋮ GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem ⋮ Improved hardness and approximation results for single allocation hub location problems ⋮ 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 ⋮ A non-triangular hub location problem ⋮ Solving the Uncapacitated Single Allocation p-Hub Median Problem on GPU ⋮ The p-hub centre routing problem with emissions budget: formulation and solution procedure ⋮ Novel formulations and VNS-based heuristics for single and multiple allocation \(p\)-hub maximal covering problems ⋮ Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ HUBBI: iterative network design for incomplete hub location problems ⋮ 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 ⋮ Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths ⋮ A general variable neighborhood search for solving the uncapacitated single allocation \(p\)-hub median problem ⋮ Team formation based on group technology: a hybrid grouping genetic algorithm approach ⋮ Single-allocation ordered median hub location problems ⋮ 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 ⋮ Exact computational approaches to a stochastic uncapacitated single allocation \(p\)-hub center problem ⋮ Uncapacitated single and multiple allocation \(p\)-hub center problems ⋮ Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs ⋮ An efficient heuristic for a hub location routing problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The \(p\)-hub center allocation problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Integer programming formulations of discrete hub location problems
- On the single-assignment \(p\)-hub center problem
- Network hub location problems: The state of the art
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems
This page was built for publication: A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
