Reverse selective obnoxious center location problems on tree graphs
From MaRDI portal
Recommendations
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
- Linear time optimal approaches for reverse obnoxious center location problems on networks
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- A linear time algorithm for inverse obnoxious center location problems on networks
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Discrete facility location and routing of obnoxious activities.
- Equilibria in Competitive Location Models
- Improving the location of minimax facilities through network modification
- Introduction to algorithms
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse center location problem on a tree
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- On dual minimum cost flow algorithms
- Reverse 1-center problem on weighted trees
- Some reverse location problems
- The complexity analysis of the inverse center location problem
- 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
Cited in
(19)- Reverse 1-centre problem on trees under convex piecewise-linear cost function
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Inverse quickest center location problem on a tree
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation
- Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
- The obnoxious center problem on a tree
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- Obnoxious Centers in Graphs
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
- Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- Robust reverse 1-center problems on trees with interval costs
- Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
- The reverse selective balance center location problem on trees
- Reverse 1-maxian problem with keeping existing 1-median
This page was built for publication: Reverse selective obnoxious center location problems on tree graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1650850)
