Further study on reverse 1-center problem on trees

DOI10.1142/S0217595920500347MaRDI QIDQ5149548zbMATH OpenOpenAlexFDO

Authors Ali Reza Sepasian, Javad Tayyebi

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

1-center problemcomplexityreverse optimizationtrees

Mathematics Subject Classification ID

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

Recommendations

• Reverse 1-center problem on weighted trees
• Reverse 1-centre problem on trees under convex piecewise-linear cost function
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
• Inverse center location problem on a tree

Cites work

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

Cited in

(11)

• A note on the robust 1-center problem on trees
• Reverse 1-center problem on weighted trees
• scientific article; zbMATH DE number 1522936 (Why is no real title available?)
• Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
• Optimal algorithms for inverse eccentric vertex location problem on extended star networks
• Reverse 1-centre problem on trees under convex piecewise-linear cost function
• 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
• The reverse selective balance center location problem on trees
• Robust reverse 1-center problems on trees with interval costs
• The absolute quickest 1-center problem on a cycle and its reverse problem

This page was built for publication: Further study on reverse 1-center problem on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149548)