Inverse center location problem on a tree
From MaRDI portal
Recommendations
- Inverse center location problems
- Reverse 1-center problem on weighted trees
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Computational aspects of the inverse single facility location problem on trees under l_k-norm
Cites work
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
- scientific article; zbMATH DE number 3503127 (Why is no real title available?)
- scientific article; zbMATH DE number 482901 (Why is no real title available?)
- Inverse combinatorial optimization: a survey on problems, methods, and results
- The complexity analysis of the inverse center location problem
Cited in
(35)- Inverse 1-center location problems with edge length augmentation on trees
- Reverse selective obnoxious center location problems on tree graphs
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Inverse quickest center location problem on a tree
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- The complexity analysis of the inverse center location problem
- Computational aspects of the inverse single facility location problem on trees under l_k-norm
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation
- Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
- Reverse 1-center problem on weighted trees
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- Inverse center location problems
- A linear time algorithm for inverse obnoxious center location problems on networks
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Inverse 1-median problem on trees under weighted Hamming distance
- scientific article; zbMATH DE number 1522936 (Why is no real title available?)
- Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
- An improved algorithm for the distance constrainedp-center location problem with mutual communication on tree networks
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms
- Optimal algorithms for some inverse uncapacitated facility location problems on networks
- Inverse stable point problem on trees under an extension of Chebyshev norm and bottleneck Hamming distance
- Further study on reverse 1-center problem on trees
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- Inverse p-median problems with variable edge lengths
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- On some inverse 1-center location problems
- Reverse 1-centre problem on trees under convex piecewise-linear cost function
- The max-sum inverse median location problem on trees with budget constraint
- Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm
- Inverse median location problems with variable coordinates
- Budget-constrained inverse median facility location problem on tree networks
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
This page was built for publication: Inverse 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 Q732826)
