Inverse and reverse balanced facility location problems with variable edge lengths on trees
From MaRDI portal
Publication:2656494
DOI10.1007/s12597-019-00428-6OpenAlexW2989584929WikidataQ126669557 ScholiaQ126669557MaRDI QIDQ2656494
Shahede Omidi, Jafar Fathali, Morteza Nazari
Publication date: 11 March 2021
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-019-00428-6
Related Items (5)
The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ The reverse selective balance center location problem on trees ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Unnamed Item ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients
Cites Work
- Unnamed Item
- Inverse 1-median problem on block graphs with variable vertex weights
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- Looking for edge-equitable spanning trees
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse \(p\)-median problems with variable edge lengths
- The discrete facility location problem with balanced allocation of customers
- Improving the location of minisum facilities through network modification
- Reverse 2-median problem on trees
- The inverse 1-median problem on a cycle
- Optimal location with equitable loads
- Inverse 1-center location problems with edge length augmentation on trees
- Equity measurement in facility location analysis: A review and framework
- Some reverse location problems
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- The complexity analysis of the inverse center location problem
- Inverse median problems
- Equality measures properties for location problems
- Reverse 1-center problem on weighted trees
- Effectiveness-equity models for facility location problems on tree networks
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Improving the location of minimax facilities through network modification
- Balanced location on a graph
- An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
- A linear time algorithm for the reverse 1‐median problem on a cycle
This page was built for publication: Inverse and reverse balanced facility location problems with variable edge lengths on trees
