Inverse and reverse balanced facility location problems with variable edge lengths on trees
From MaRDI portal
Publication:2656494
Recommendations
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- The inverse 1-median problem on tree networks with variable real edge lengths
- scientific article; zbMATH DE number 7709522
- Inverse p-median problems with variable edge lengths
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
Cites work
- A linear time algorithm for the reverse 1‐median problem on a cycle
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- Balanced location on a graph
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Effectiveness-equity models for facility location problems on tree networks
- Equality measures properties for location problems
- Equity measurement in facility location analysis: A review and framework
- Improving the location of minimax facilities through network modification
- Improving the location of minisum facilities through network modification
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse 1-median problem on block graphs with variable vertex weights
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse p-median problems with variable edge lengths
- Inverse median problems
- Looking for edge-equitable spanning trees
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Optimal location with equitable loads
- Reverse 1-center problem on weighted trees
- Reverse 2-median problem on trees
- Some reverse location problems
- The complexity analysis of the inverse center location problem
- The discrete facility location problem with balanced allocation of customers
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- The inverse 1-median problem on a cycle
- The inverse 1-median problem on a tree and on a path
Cited in
(5)- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation
- scientific article; zbMATH DE number 7709522 (Why is no real title available?)
- 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
This page was built for publication: Inverse and reverse balanced facility location problems with variable edge lengths on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2656494)
