Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
DOI10.1080/02331934.2022.2116937OpenAlexW4294043818MaRDI QIDQ6192079FDOQ6192079
Authors: Mehran Hasanzadeh, Behrooz Alizadeh, Fahimeh Baroughi 
Publication date: 11 March 2024
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2022.2116937
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
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- The complexity analysis of the inverse center location problem
- Inverse median problems
- 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
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse \(p\)-median problems with variable edge lengths
- Analytical models for locating undesirable facilities
- The inverse 1-maxian problem with edge length modification
- Up- and downgrading the 1-center in a network
- Network and discrete location. Models, algorithms, and applications
- Improving the location of minimax facilities through network modification
- Foundations of location analysis
- Some reverse location problems
- The inverse \(p\)-maxian problem on trees with variable edge lengths
- Improving the location of minisum facilities through network modification
- On some inverse 1-center location problems
- Reverse 1-maxian problem with keeping existing 1-median
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Reverse selective obnoxious center location problems on tree graphs
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Upgrading min-max spanning tree problem under various cost functions
- An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector
- 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
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- Reverse maximum flow problem under the weighted Chebyshev distance
- Inverse eccentric vertex problem on trees
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)
