Recommendations
- The reverse 1-median problem on a cycle under the Hamming distance
- A linear time algorithm for the reverse 1‐median problem on a cycle
- The inverse 1-median problem on a tree and on a path
- Median problems with positive and negative weights on cycles and cacti
- Inverse median problems
- The reversal median problem
- Inverse p-median problems with variable edge lengths
- The inverse 1-center problem on cycles with variable edge lengths
- Inverse group 1-median problem on trees
- Inverse 1-median problem on block graphs with variable vertex weights
Cites work
- A linear time algorithm for the reverse 1‐median problem on a cycle
- Improving the location of minisum facilities through network modification
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse median problems
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- On an instance of the inverse shortest paths problem
- Some reverse location problems
- The complexity analysis of the inverse center location problem
Cited in
(54)- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- A modified particle swarm optimization algorithm for general inverse ordered \(p\)-median location problem on networks
- A model for the inverse 1-Median problem on trees under uncertain costs
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- The reverse 1-median problem on a cycle under the Hamming distance
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
- Inverse quickest center location problem on a tree
- The 1-median problem in \(\mathbb{R}^d\) with the Chebyshev-norm and its inverse problem
- The cardinality constrained inverse center location problems on tree networks with edge length augmentation
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- Inverse \(p\)-median problems with variable edge lengths
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- Inverse 1-median problem on block graphs with variable vertex weights
- Inverse and reverse balanced facility location problems with variable edge lengths on trees
- An inverse approach to convex ordered median problems in trees
- The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion
- The inverse connected \(p\)-median problem on block graphs under various cost functions
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- On some inverse 1-center location problems
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
- Classical and inverse median location problems under uncertain environment
- Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
- A linear time algorithm for inverse obnoxious center location problems on networks
- The inverse Fermat-Weber problem
- Inverse 1-center location problems with edge length augmentation on trees
- Inverse 1-median problem on trees under weighted Hamming distance
- Upgrading \(p\)-median problem on a path
- 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
- The inverse 1-center problem on cycles with variable edge lengths
- The inverse 1-median problem on tree networks with variable real edge lengths
- The reversal median problem
- A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs
- Inverse single facility location problem on a tree with balancing on the distance of server to clients
- A linear time algorithm for the reverse 1‐median problem on a cycle
- 2-balanced flows and the inverse 1-median problem in the Chebyshev space
- 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
- scientific article; zbMATH DE number 7709522 (Why is no real title available?)
- Median problems with positive and negative weights on cycles and cacti
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
- Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks
- 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
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- Inverse median location problems with variable coordinates
- Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- Reverse 1-maxian problem with keeping existing 1-median
- Some robust inverse median problems on trees with interval costs
- The max-sum inverse median location problem on trees with budget constraint
- A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment
This page was built for publication: The inverse 1-median problem on a cycle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951097)
