Inverse 1-median problem on block graphs with variable vertex weights
From MaRDI portal
Recommendations
- The inverse connected p-median problem on block graphs under various cost functions
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- The inverse 1-median problem on a cycle
- The inverse 1-median problem on a tree and on a path
- Inverse p-median problems with variable edge lengths
Cites work
- A linear time algorithm for inverse obnoxious center location problems on networks
- An Algorithm for Large Zero-One Knapsack Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- An inverse approach to convex ordered median problems in trees
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Graph theory with applications
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Inverse \(p\)-median problems with variable edge lengths
- Inverse eccentric vertex problem on networks
- Inverse median problems
- Location theory. A unified approach
- 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-median problem on a cycle
- The inverse 1-median problem on a tree and on a path
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
Cited in
(38)- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Resource allocation in rooted trees for VLSI applications
- Reverse 1-centre problem on trees under convex piecewise-linear cost function
- The inverse 1-median problem on a cycle
- 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
- Some robust inverse median problems on trees with interval costs
- The max-sum inverse median location problem on trees with budget constraint
- A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- The inverse connected \(p\)-median problem on block graphs under various cost functions
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- On some inverse 1-center location problems
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
- Classical and inverse median location problems under uncertain environment
- Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
- Inverse group 1-median problem on trees
- The inverse 1-median problem on a tree with transferring the weight of vertices
- Block-vertex duality and the one-median problem
- The inverse 1-center problem on cycles with variable edge lengths
- A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- The minmax regret inverse maximum weight problem
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
- Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
- Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
- Reverse 1-maxian problem with keeping existing 1-median
This page was built for publication: Inverse 1-median problem on block graphs with variable vertex weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283940)
