Improved hardness and approximation results for single allocation hub location
DOI10.1007/978-3-030-57602-8_8zbMath1482.68187OpenAlexW3048220526MaRDI QIDQ2039648
Yonghao Wang, An Zhang, Xing Wang, Guangting Chen, Yong Chen, Guo-Hui Lin
Publication date: 5 July 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_8
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
- A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
- Optimal design of a distributed network with a two-level hierarchical structure
- A linear program for the two-hub location problem
- Integer programming formulations of discrete hub location problems
- On the single-assignment \(p\)-hub center problem
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
- The approximability of the \(p\)-hub center problem with parameterized triangle inequality
- Network hub location problems: The state of the art
- Hub Location and the p-Hub Median Problem
- The single allocation problem in the interacting three-hub network
This page was built for publication: Improved hardness and approximation results for single allocation hub location
