Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms

DOI10.2298/YJOR160317012EzbMath1474.90375OpenAlexW2436778312MaRDI QIDQ4987701

Behrooz Alizadeh, Roghayeh Etemad

Publication date: 3 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/yjor160317012e

zbMATH Keywords

combinatorial optimizationtime complexitytree graphsreverse optimizationcenter location problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Continuous location (90B85) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ 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 ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ Reverse 1-maxian problem with keeping existing 1-median ⋮ Further Study on Reverse 1-Center Problem on Trees

Cites Work

• Unnamed Item
• A linear time algorithm for inverse obnoxious center location problems on networks
• Inverse eccentric vertex problem on networks
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Inverse center location problem on a tree
• Inverse 1-center location problems with edge length augmentation on trees
• On dual minimum cost flow algorithms
• A network improvement problem under different norms
• Some reverse location problems
• The complexity analysis of the inverse center location problem
• Reverse 1-center problem on weighted trees
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Ottimizzazione Combinatoria
• Improving the location of minimax facilities through network modification