Optimal algorithms for inverse vertex obnoxious center location problems on graphs
From MaRDI portal
Publication:1685960
Recommendations
- A linear time algorithm for inverse obnoxious center location problems on networks
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
Cites work
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 59833 (Why is no real title available?)
- scientific article; zbMATH DE number 1091317 (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
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- Discrete facility location and routing of obnoxious activities.
- Improving the location of minimax facilities through network modification
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse center location problem on a tree
- Inverse eccentric vertex problem on networks
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Ottimizzazione Combinatoria
- Reverse 1-center problem on weighted trees
- Some reverse location problems
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- 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
(17)- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Reverse 1-centre problem on trees under convex piecewise-linear cost function
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- 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
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- A linear time algorithm for inverse obnoxious center location problems on networks
- Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- scientific article; zbMATH DE number 4020808 (Why is no real title available?)
- Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
- Optimal algorithms for inverse eccentric vertex location problem on extended star networks
- 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
This page was built for publication: Optimal algorithms for inverse vertex obnoxious center location problems on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685960)
