Reverse 1-centre problem on trees under convex piecewise-linear cost function
From MaRDI portal
(Redirected from Publication:5882838)
Recommendations
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 1522936 (Why is no real title available?)
- A linear time algorithm for the reverse 1‐median problem on a cycle
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
- 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
- Extensive facility location problems on networks: an updated review
- Improving the location of minimax facilities through network modification
- Improving the location of minisum facilities through network modification
- Inverse 1-median problem on block graphs with variable vertex weights
- Inverse median problems
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Network flows. Theory, algorithms, and applications.
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Reverse 1-center problem on weighted trees
- Reverse 2-median problem on trees
- Reverse selective obnoxious center location problems on tree graphs
- Some reverse location problems
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- 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 Fermat-Weber problem
- The worst-case running time of the random simplex algorithm is exponential in the height
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
Cited in
(9)- Reverse 1-center problem on weighted trees
- Further study on reverse 1-center problem on trees
- Upgrading the 1-center problem with edge length variables on a tree
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
- Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
- The reverse selective balance center location problem on trees
- scientific article; zbMATH DE number 1522936 (Why is no real title available?)
- The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
- Robust reverse 1-center problems on trees with interval costs
This page was built for publication: Reverse 1-centre problem on trees under convex piecewise-linear cost function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882838)
