On some inverse 1-center location problems

DOI10.1080/02331934.2019.1571056zbMath1415.90015OpenAlexW2921127441WikidataQ128259034 ScholiaQ128259034MaRDI QIDQ5382943

Huong Nguyen-Thu, Nguyen Thanh Hung, Kien Trung Nguyen, van Huy Pham, Tran Thu Le

Publication date: 19 June 2019

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2019.1571056

zbMATH Keywords

location probleminterval graphinverse optimization1-center

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (7)

The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ 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 ⋮ Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse 1-median problem on block graphs with variable vertex weights
• Inverse eccentric vertex problem 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
• An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• A linear time recognition algorithm for proper interval graphs
• Inverse 1-center location problems with edge length augmentation on trees
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• 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
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Efficient algorithms for centers and medians in interval and circular-arc graphs
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees

This page was built for publication: On some inverse 1-center location problems