A linear time algorithm for the reverse 1‐median problem on a cycle
From MaRDI portal
Publication:5487819
DOI10.1002/net.20115zbMath1103.90082OpenAlexW4255254755MaRDI QIDQ5487819
Rainer E. Burkard, Johannes Hatzl, Elisabeth Gassner
Publication date: 12 September 2006
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20115
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (19)
Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ Upgrading edges in the maximal covering location problem ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ Upgrading \(p\)-median problem on a path ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ Unnamed Item ⋮ Reverse 1-maxian problem with keeping existing 1-median ⋮ Further Study on Reverse 1-Center Problem on Trees ⋮ The inverse 1-maxian problem with edge length modification ⋮ Reverse 2-median problem on trees ⋮ The inverse 1-median problem on a cycle ⋮ The inverse Fermat-Weber problem ⋮ Reverse 1-center problem on weighted trees ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ Up- and downgrading the 1-center in a network ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks
Cites Work
This page was built for publication: A linear time algorithm for the reverse 1‐median problem on a cycle
