The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
From MaRDI portal
(Redirected from Publication:326486)
Recommendations
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- Inverse 1-center location problems with edge length augmentation on trees
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Inverse 1-median problem on trees under weighted Hamming distance
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
Cites work
- scientific article; zbMATH DE number 4123493 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- 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
- Reverse 1-center problem on weighted trees
- The complexity analysis of the inverse center location problem
- The inverse 1-median problem on a cycle
- The inverse 1-median problem on a tree and on a path
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Up- and downgrading the 1-center in a network
Cited in
(42)- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Reverse 1-centre problem on trees under convex piecewise-linear cost function
- 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
- Inverse quickest center location problem on a tree
- Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Inverse 1-median problem on block graphs with variable vertex weights
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- The inverse connected \(p\)-median problem on block graphs under various cost functions
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- On some inverse 1-center location problems
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- Reverse selective obnoxious center location problems on tree graphs
- Speedup the optimization of maximal closure of a node-weighted directed acyclic graph
- Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse group 1-median problem on trees
- Inverse eccentric vertex problem on trees
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- The inverse 1-center problem on cycles with variable edge lengths
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
- The inverse \(p\)-maxian problem on trees with variable edge lengths
- Upgrading edges in the maximal covering location problem
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- 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
- 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
- Inverse minimum flow problem under the weighted sum-type Hamming distance
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- Optimal algorithms for inverse eccentric vertex location problem on extended star networks
- Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
- Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
- Reverse 1-maxian problem with keeping existing 1-median
- Constrained inverse minimum flow problems under the weighted Hamming distance
This page was built for publication: The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326486)
