Reverse 2-median problem on trees

DOI10.1016/j.dam.2007.04.005zbMath1216.90072OpenAlexW1964814425MaRDI QIDQ943832

Rainer E. Burkard, Johannes Hatzl, Elisabeth Gassner

Publication date: 10 September 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.04.005

zbMATH Keywords

combinatorial optimizationfacility locationmedian problemsreverse optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Combinatorial optimization (90C27)

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 ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ Unnamed Item ⋮ Notes on inverse bin-packing problems ⋮ 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 ⋮ 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

• Improving the location of minisum facilities through network modification
• Modifying edges of a network to obtain short subgraphs
• Approximation algorithms for certain network improvement problems
• Weight reduction problems with certain bottleneck objectives.
• Inapproximability and a polynomially solvable special case of a network improvement problem.
• A network improvement problem under different norms
• Some reverse location problems
• The complexity analysis of the inverse center location problem
• Inverse median problems
• Bottleneck Capacity Expansion Problems with General Budget Constraints
• An Algorithm for Large Zero-One Knapsack Problems
• Maximizing the minimum source-sink path subject to a budget constraint
• Improving the location of minimax facilities through network modification
• Increasing the Weight of Minimum Spanning Trees
• A linear time algorithm for the reverse 1‐median problem on a cycle
• Unnamed Item

This page was built for publication: Reverse 2-median problem on trees