Inverse quickest center location problem on a tree
From MaRDI portal
Recommendations
- Inverse center location problem on a tree
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Inverse 1-center location problems with edge length augmentation on trees
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Reverse 1-center problem on weighted trees
- Reverse selective obnoxious center location problems on tree graphs
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
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?)
- A label-setting algorithm for finding a quickest path
- A linear time algorithm for inverse obnoxious center location problems on networks
- A note on the robust 1-center problem on trees
- A polynomial method for the pos/neg weighted 3-median problem on a tree
- Algorithms for the quickest path problem and the enumeration of quickest paths
- Algorithms for the quickest path problem and the reliable quickest path problem
- An algorithm for the quickest path problem
- An inverse approach to convex ordered median problems in trees
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Distributed algorithms for the quickest path problem
- 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 center location problem on a tree
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse eccentric vertex problem on networks
- Inverse median problems
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Median problems with positive and negative weights on cycles and cacti
- Network flows. Theory, algorithms, and applications.
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Reverse 1-center problem on weighted trees
- Reverse selective obnoxious center location problems on tree graphs
- The p-maxian problem on a tree
- The complexity analysis of the inverse center location problem
- 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 Fermat-Weber problem
- The quickest path problem
Cited in
(10)- The inverse connected p-median problem on block graphs under various cost functions
- Solving the absolute 1-center problem in the quickest path case
- Inverse group 1-median problem on trees
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
- Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
- Inverse integer optimization with multiple observations
- The max-sum inverse median location problem on trees with budget constraint
- Minimizing the expense transmission time from the source node to demand nodes
- Optimal algorithms for inverse eccentric vertex location problem on extended star networks
- Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms
This page was built for publication: Inverse quickest center location problem on a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741512)
