Linear time optimal approaches for reverse obnoxious center location problems on networks

DOI10.1080/02331934.2016.1203915zbMath1351.90111OpenAlexW2462371941MaRDI QIDQ2836087

Roghayeh Etemad, Behrooz Alizadeh

Publication date: 7 December 2016

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

combinatorial optimizationtime complexityobnoxious center locationreverse optimization

Mathematics Subject Classification ID

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

Related Items (16)

Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Reverse selective obnoxious center location problems on tree graphs ⋮ Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ 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 ⋮ Upgrading edges in the maximal covering location problem ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ 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 ⋮ 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 ⋮ Inverse quickest center location problem on a tree ⋮ Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms

Cites Work

• 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 1-median problem on trees under weighted Hamming distance
• Inverse \(p\)-median problems with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Improving the location of minisum facilities through network modification
• Inverse center location problem on a tree
• The inverse 1-maxian problem with edge length modification
• Reverse 2-median problem on trees
• The inverse 1-median problem on a cycle
• Inverse 1-center location problems with edge length augmentation on trees
• Analytical models for locating undesirable facilities
• Discrete facility location and routing of obnoxious activities.
• Some reverse location problems
• The complexity analysis of the inverse center location problem
• Inverse median problems
• Reverse 1-center problem on weighted trees
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Inverse Optimization
• Improving the location of minimax facilities through network modification
• A linear time algorithm for the reverse 1‐median problem on a cycle

This page was built for publication: Linear time optimal approaches for reverse obnoxious center location problems on networks