Reverse 1-center problem on weighted trees

DOI10.1080/02331934.2014.994626zbMath1332.90052OpenAlexW2007461428MaRDI QIDQ2790878

Kien Trung Nguyen

Publication date: 8 March 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2014.994626

zbMATH Keywords

treelocation problem1-centerreverse optimization

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (23)

Solving the absolute 1-center problem in the quickest path case ⋮ Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance ⋮ Reverse selective obnoxious center location problems on tree graphs ⋮ Upgrading the 1-center problem with edge length variables on a tree ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ 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 ⋮ The reverse selective balance center location problem on trees ⋮ Unnamed Item ⋮ Reverse 1-maxian problem with keeping existing 1-median ⋮ Further Study on Reverse 1-Center Problem on Trees ⋮ Inverse quickest center location problem on a tree ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ A survey of network interdiction models and algorithms ⋮ A model for the inverse 1-median problem on trees under uncertain costs ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

Cites Work

• A linear time algorithm for inverse obnoxious center location problems on networks
• Inverse \(p\)-median problems with variable edge lengths
• Inverse median location problems with variable coordinates
• Improving the location of minisum facilities through network modification
• Foundations of location analysis
• Reverse 2-median problem on trees
• Some reverse location problems
• Inverse median problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Improving the location of minimax facilities through network modification
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
• A linear time algorithm for the reverse 1‐median problem on a cycle

This page was built for publication: Reverse 1-center problem on weighted trees