The inverse 1-median problem on a tree and on a path
From MaRDI portal
(Redirected from Publication:2861561)
Recommendations
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse \(k\)-centrum problem on trees with variable vertex weights
Cites work
Cited in
(46)- Classical and inverse median location problems under uncertain environment
- Inverse anti-k-centrum problem on networks with variable edge lengths
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
- Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
- The inverse 1-median problem on tree networks with variable real edge lengths
- Inverse group 1-median problem on trees
- Inverse 1-median problem on block graphs with variable vertex weights
- Unified approach to the inverse median location problem under the sum and the max objectives applying ordered median function
- A linear time algorithm for inverse obnoxious center location problems on networks
- 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
- An inverse approach to convex ordered median problems in trees
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- The inverse 1-median problem on a cycle
- Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
- Inverse 1-center location problems with edge length augmentation on trees
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
- Some robust inverse median problems on trees with interval costs
- Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
- Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm
- A linear time algorithm for the reverse 1‐median problem on a cycle
- 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
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- Reverse 2-median problem on trees
- Inverse median problems
- A model for the inverse 1-Median problem on trees under uncertain costs
- The inverse 1-center problem on cycles with variable edge lengths
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- scientific article; zbMATH DE number 7709522 (Why is no real title available?)
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- The inverse 1-median problem on a tree with transferring the weight of vertices
- Finding the conditional location of a median path on a tree
- Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
- On some inverse 1-center location problems
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- Computational aspects of the inverse single facility location problem on trees under l_k-norm
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
This page was built for publication: The inverse 1-median problem on a tree and on a path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861561)
