Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs

DOI10.1007/s40305-016-0144-0zbMath1387.90111OpenAlexW2558026178MaRDI QIDQ1697898

Roghayeh Etemad, Behrooz Alizadeh

Publication date: 20 February 2018

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-016-0144-0

zbMATH Keywords

combinatorial optimizationtime complexityreverse optimizationundesirable center location

Mathematics Subject Classification ID

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

Related Items (6)

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 ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ 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 ⋮ 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
• 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
• 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
• The inverse 1-maxian problem with edge length modification
• Reverse 2-median problem on trees
• Inverse 1-center location problems with edge length augmentation on trees
• 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
• 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
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
• Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms

This page was built for publication: Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs