Inverse k-centrum problem on trees with variable vertex weights
From MaRDI portal
Publication:494693
Recommendations
- An inverse approach to convex ordered median problems in trees
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- Inverse center location problem on a tree
- The inverse 1-median problem on a tree and on a path
- Inverse \(p\)-median problems with variable edge lengths
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Algorithmic results for ordered median problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An inverse approach to convex ordered median problems in trees
- 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 \(p\)-median problems with variable edge lengths
- Inverse eccentric vertex problem on networks
- Inverse median location problems with variable coordinates
- Inverse median problems
- Location theory. A unified approach
- 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
- The inverse Fermat-Weber problem
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
Cited in
(34)- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- A model for the inverse 1-Median problem on trees under uncertain costs
- Reverse 1-center problem on weighted trees
- Inverse quickest center location problem on a tree
- Some robust inverse median problems on trees with interval costs
- scientific article; zbMATH DE number 5732600 (Why is no real title available?)
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- Solving the absolute 1-center problem in the quickest path case
- Inverse \(p\)-median problems with variable edge lengths
- The max-sum inverse median location problem on trees with budget constraint
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
- Inverse 1-median problem on block graphs with variable vertex weights
- Minimizing the expense transmission time from the source node to demand nodes
- Computation of inverse 1-centre location problem on the weighted interval graphs
- The inverse connected \(p\)-median problem on block graphs under various cost functions
- The inverse 1-median problem on a tree and on a path
- On some inverse 1-center location problems
- Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
- Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
- The complexity analysis of the inverse center location problem
- Inverse group 1-median problem on trees
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- Multi-depot traveling salesmen location problems on networks with special structure
- The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
- The inverse 1-center problem on cycles with variable edge lengths
- Inverse center location problem on a tree
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- 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 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
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
This page was built for publication: Inverse \(k\)-centrum problem on trees with variable vertex weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494693)
