Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
From MaRDI portal
Publication:6192079
Recommendations
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- A linear time algorithm for inverse obnoxious center location problems on networks
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
Cites work
- A linear time algorithm for inverse obnoxious center location problems on networks
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- Analytical models for locating undesirable facilities
- 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
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Foundations of location analysis
- Improving the location of minimax facilities through network modification
- Improving the location of minisum facilities through network modification
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse p-median problems with variable edge lengths
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- Inverse eccentric vertex problem on trees
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- Inverse median problems
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Network and discrete location. Models, algorithms, and applications
- On some inverse 1-center location problems
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Reverse 1-maxian problem with keeping existing 1-median
- Reverse maximum flow problem under the weighted Chebyshev distance
- Reverse selective obnoxious center location problems on tree graphs
- 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
- The inverse 1-maxian problem with edge length modification
- The inverse \(p\)-maxian problem on trees with variable edge lengths
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- Up- and downgrading the 1-center in a network
- Upgrading min-max spanning tree problem under various cost functions
Cited in
(1)
This page was built for publication: Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6192079)
