Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
type: Item
instance of: scholarly article
title: Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
zbMATH Open document ID: 1387.90111
author: Roghayeh Etemad
author: Behrooz Alizadeh
published in: Journal of the Operations Research Society of China
publication date: 2018-02-20T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B85
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6841400
zbMATH Keywords: undesirable center location
zbMATH Keywords: reverse optimization
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: time complexity
MaRDI profile type: Publication
full work available at URL: s40305-016-0144-0
OpenAlex ID: W2558026178
cites work: Discrete facility location and routing of obnoxious activities.
cites work: Q4367080
cites work: The inverse 1-maxian problem with edge length modification
cites work: The inverse 1-median problem on a tree and on a path
cites work: A linear time algorithm for inverse obnoxious center location problems on networks
cites work: Linear time optimal approaches for reverse obnoxious center location problems on networks
cites work: Improving the location of minimax facilities through network modification
cites work: The complexity analysis of the inverse center location problem
cites work: Inverse eccentric vertex problem on networks
cites work: Some reverse location problems
cites work: Inverse 1-center location problems with edge length augmentation on trees
cites work: Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
cites work: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
cites work: Reverse 1-center problem on weighted trees
cites work: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
cites work: Inverse \(k\)-centrum problem on trees with variable vertex weights
cites work: Improving the location of minisum facilities through network modification
cites work: Inverse \(p\)-median problems with variable edge lengths
cites work: Reverse 2-median problem on trees
cites work: Inverse median problems
cites work: An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
cites work: Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
DOI: 10.1007/S40305-016-0144-0
description: scientific article; zbMATH DE number 6841400