Optimal algorithms for some inverse uncapacitated facility location problems on networks
From MaRDI portal
Publication:5043849
DOI10.1080/10556788.2021.1880578zbMath1498.90126OpenAlexW3128516877MaRDI QIDQ5043849
Fahimeh Baroughi, Behrooz Alizadeh, Mehran Hasanzadeh
Publication date: 6 October 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2021.1880578
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Inverse 1-median problem on block graphs with variable vertex weights
- A linear time algorithm for inverse obnoxious center location problems on networks
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- Inverse \(p\)-median problems with variable edge lengths
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Inverse median location problems with variable coordinates
- Improving the location of minisum facilities through network modification
- Reverse 2-median problem on trees
- Inverse 1-center location problems with edge length augmentation on trees
- On the exact solution of large-scale simple plant location problems
- Reverse selective obnoxious center location problems on tree graphs
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- The inverse 1-center problem on cycles with variable edge lengths
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Reverse 1-maxian problem with keeping existing 1-median
- Fast bounding procedures for large instances of the simple plant location problem
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- The complexity analysis of the inverse center location problem
- The simple plant location problem: Survey and synthesis
- Solving covering problems and the uncapacitated plant location problem on trees
- Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- 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, Second Edition
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- A Dual-Based Procedure for Uncapacitated Facility Location
- An Algorithm for Large Zero-One Knapsack Problems
- Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems
- An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- A linear time algorithm for the reverse 1‐median problem on a cycle
