Optimal algorithms for inverse vertex obnoxious center location problems on graphs

DOI10.1016/j.tcs.2017.10.001zbMath1396.90092OpenAlexW2763339573MaRDI QIDQ1685960

Roghayeh Etemad, Behrooz Alizadeh

Publication date: 20 December 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.10.001

zbMATH Keywords

combinatorial optimizationtime complexityinverse optimizationobnoxious center location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (12)

Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Reverse 1-maxian problem with keeping existing 1-median ⋮ Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• 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
• Discrete facility location and routing of obnoxious activities.
• Some reverse location problems
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
• 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
• Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms

This page was built for publication: Optimal algorithms for inverse vertex obnoxious center location problems on graphs