Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
From MaRDI portal
Publication:1988619
DOI10.11650/tjm/190602zbMath1436.90028OpenAlexW2949678239MaRDI QIDQ1988619
van Huy Pham, Kien Trung Nguyen
Publication date: 23 April 2020
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.twjm/1561082413
Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items (1)
Cites Work
- Unnamed Item
- 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 \(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
- Inverse median location problems with variable coordinates
- Foundations of location analysis
- The inverse 1-median problem on a cycle
- The inverse Fermat-Weber problem
- Inverse 1-center location problems with edge length augmentation on trees
- The complexity analysis of the inverse center location problem
- Inverse median problems
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Location Theory
- Some polynomially solvable cases of the inverse ordered 1-median problem on trees
This page was built for publication: Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
