The inverse 1-median problem on a cycle
From MaRDI portal
Publication:951097
DOI10.1016/j.disopt.2006.11.008zbMath1177.90245OpenAlexW1999428150MaRDI QIDQ951097
Rainer E. Burkard, Carmen Pleschiutschnig, Zhang, Jianzhong
Publication date: 29 October 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.11.008
Continuous location (90B85) Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (48)
On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ Inverse 1-median problem on block graphs with variable vertex weights ⋮ A linear time algorithm for inverse obnoxious center location problems on networks ⋮ Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms ⋮ 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 and reverse balanced facility location problems with variable edge lengths on trees ⋮ The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ 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 ⋮ 2-balanced flows and the inverse 1-median problem in the Chebyshev space ⋮ Unnamed Item ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ Upgrading \(p\)-median problem on a path ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Inverse median location problems with variable coordinates ⋮ An inverse approach to convex ordered median problems in trees ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Unnamed Item ⋮ The inverse 1-median problem on tree networks with variable real edge lengths ⋮ On some inverse 1-center location problems ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ Reverse 1-maxian problem with keeping existing 1-median ⋮ Inverse \(k\)-centrum problem on trees with variable vertex weights ⋮ Inverse quickest center location problem on a tree ⋮ Classical and inverse median location problems under uncertain environment ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem 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 ⋮ The inverse Fermat-Weber problem ⋮ Unnamed Item ⋮ A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms ⋮ Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems ⋮ A model for the inverse 1-median problem on trees under uncertain costs ⋮ An 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 ⋮ Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ Inverse single facility location problem on a tree with balancing on the distance of server to clients ⋮ Inverse 1-center location problems with edge length augmentation on trees ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
Cites Work
- Improving the location of minisum facilities through network modification
- On an instance of the inverse shortest paths problem
- Some reverse location problems
- The complexity analysis of the inverse center location problem
- 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
- A linear time algorithm for the reverse 1‐median problem on a cycle
This page was built for publication: The inverse 1-median problem on a cycle
