Reverse selective obnoxious center location problems on tree graphs

DOI10.1007/s00186-017-0624-yzbMath1391.90372OpenAlexW2770978752MaRDI QIDQ1650850

Roghayeh Etemad, Behrooz Alizadeh

Publication date: 13 July 2018

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

Full work available at URL: https://doi.org/10.1007/s00186-017-0624-y

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

Reverse 1-centre problem on trees under convex piecewise-linear cost function, Optimal algorithms for some inverse uncapacitated facility location problems on networks, Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks, The cardinality constrained inverse center location problems on tree networks with edge length augmentation, 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, 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

Cites Work

• Unnamed Item
• Unnamed Item
• A linear time algorithm for inverse obnoxious center location problems 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
• On dual minimum cost flow algorithms
• Discrete facility location and routing of obnoxious activities.
• 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
• Improving the location of minimax facilities through network modification
• Equilibria in Competitive Location Models