Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
From MaRDI portal
Publication:2330101
Recommendations
- Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- 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 tree and on a path
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
Cites work
- An Algorithm for Large Zero-One Knapsack Problems
- 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
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- 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 \(k\)-centrum problem on trees with variable vertex weights
- Inverse p-median problems with variable edge lengths
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse median problems
- Inverse quickest center location problem on a tree
- On an instance of the inverse shortest paths problem
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
- The complexity analysis of the inverse center location problem
- 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 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
(17)- Inverse group 1-median problem on trees
- Solving the absolute 1-center problem in the quickest path case
- Computational aspects of the inverse single facility location problem on trees under l_k-norm
- 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
- Inverse 1-median problem on trees under weighted \(l _{ \infty }\) norm
- An inverse approach to convex ordered median problems in trees
- 2-median location improvement problems under weighted \(l_1\) norm and \(l_\infty\) norm on trees
- Optimal algorithms for inverse eccentric vertex location problem on extended star networks
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
- The max-sum inverse median location problem on trees with budget constraint
- Minimizing the expense transmission time from the source node to demand nodes
- Robust reverse 1-center problems on trees with interval costs
- The inverse center subtree problem on tree graphs
This page was built for publication: Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2330101)
