Further Study on Reverse 1-Center Problem on Trees

DOI10.1142/S0217595920500347zbMath1461.90025OpenAlexW3035871863MaRDI QIDQ5149548

Javad Tayyebi, Ali Reza Sepasian

Publication date: 11 February 2021

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595920500347

zbMATH Keywords

complexitytrees1-center problemreverse optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ The reverse selective balance center location problem on trees ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Cites Work

• Improving the location of minisum facilities through network modification
• Reverse 2-median problem on trees
• Some reverse location problems
• Upgrading min-max spanning tree problem under various cost functions
• Computation of the reverse shortest-path problem
• The shortest path improvement problems under Hamming distance
• On budget-constrained flow improvement.
• Reverse 1-center problem on weighted trees
• Improving the location of minimax facilities through network modification
• Reverse maximum flow problem under the weighted Chebyshev distance
• Efficient algorithms for the reverse shortest path problem on trees under the hamming distance
• Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
• A linear time algorithm for the reverse 1‐median problem on a cycle
• Unnamed Item

This page was built for publication: Further Study on Reverse 1-Center Problem on Trees