The hardness and approximation of the star \(p\)-hub center problem
From MaRDI portal
Publication:1949676
DOI10.1016/j.orl.2012.12.007zbMath1270.90057OpenAlexW1969707757MaRDI QIDQ1949676
Publication date: 14 May 2013
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.12.007
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (9)
On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality ⋮ On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality ⋮ Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality ⋮ Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs ⋮ Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs ⋮ A parameterized approximation algorithm for the multiple allocation \(k\)-hub center ⋮ Approximation algorithms for median hub location problems ⋮ A combined average-case and worst-case analysis for an integrated hub location and revenue management problem ⋮ Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs
This page was built for publication: The hardness and approximation of the star \(p\)-hub center problem
