Inverse group 1-median problem on trees
From MaRDI portal
Publication:2031325
DOI10.3934/jimo.2019108zbMath1474.90085OpenAlexW2977721613MaRDI QIDQ2031325
Vo Nguyen Minh Hieu, Kien Trung Nguyen, van Huy Pham
Publication date: 9 June 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2019108
Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Solving the absolute 1-center problem in the quickest path case ⋮ The max-sum inverse median location problem on trees with budget constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Inverse 1-median problem on block graphs with variable vertex weights
- A linear time algorithm for inverse obnoxious center location problems on networks
- 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
- An inverse approach to convex ordered median problems in 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
- Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
- The inverse Fermat-Weber problem
- Group centre and group median of a network
- On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks
- Extensive facility location problems on networks: an updated review
- 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
- Inverse quickest center location problem on a tree
- Group centre and group median of a tree
- The complexity analysis of the inverse center location problem
- Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
- Inverse median problems
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Location Theory
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
