A linear time algorithm for inverse obnoxious center location problems on networks

DOI10.1007/s10100-012-0248-5zbMath1339.90188OpenAlexW2000740510MaRDI QIDQ301046

Rainer E. Burkard, Behrooz Alizadeh

Publication date: 29 June 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-012-0248-5

zbMATH Keywords

optimizationcomputational complexitycombinatorial optimizationinverseobnoxious center location

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (26)

Inverse 1-median problem on block graphs with variable vertex weights ⋮ 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 ⋮ 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 ⋮ Unnamed Item ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ Inverse quickest center location problem on a tree ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ The minmax regret inverse maximum weight problem ⋮ Reverse 1-center problem on weighted trees ⋮ Inverse group 1-median problem on trees ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An inverse approach to convex ordered median problems in trees
• Inverse \(p\)-median problems with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• Inverse median location problems with variable coordinates
• Inverse center location problem on a tree
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• Inverse 1-center location problems with edge length augmentation on trees
• Discrete facility location and routing of obnoxious activities.
• The complexity analysis of the inverse center location problem
• Inverse median problems
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees

This page was built for publication: A linear time algorithm for inverse obnoxious center location problems on networks