Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
From MaRDI portal
(Redirected from Publication:5085261)
Recommendations
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- Inverse bottleneck Steiner tree problem under norm
- Inverse 1-median problem on trees under weighted Hamming distance
- Some inverse optimization problems under the Hamming distance
Cites work
- A linear time algorithm for inverse obnoxious center location problems on networks
- A model for the inverse 1-Median problem on trees under uncertain costs
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An Axiomatic Approach to Location on Networks
- An inverse approach to convex ordered median problems in trees
- 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
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Inverse p-median problems with variable edge lengths
- 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 center location problem on a tree
- Inverse maximum flow problems under the combining norms
- Inverse median problems
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
- On some inverse 1-center location problems
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
- The complexity analysis of the inverse center location problem
- The inverse \(p\)-maxian problem on trees with variable edge lengths
- The inverse 1-center problem on cycles with variable edge lengths
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- The inverse 1-maxian problem with edge length modification
- 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
(4)- Inverse bottleneck Steiner tree problem under norm
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
- Stability radius and an upgrading model of median location on trees
This page was built for publication: Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085261)
