Inverse center location problem on a tree

DOI10.1007/s11424-008-9142-6zbMath1180.90171OpenAlexW2037786046MaRDI QIDQ732826

Zhang, Jianzhong, Xiao-guang Yang

Publication date: 15 October 2009

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-008-9142-6

zbMATH Keywords

treecenter locationcombinatorial linear programtwo-terminal series parallel graphs

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Inverse center location problems ⋮ 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 ⋮ Reverse selective obnoxious center location problems on tree graphs ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ Inverse median location problems with variable coordinates ⋮ Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm ⋮ Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Inverse quickest center location problem on a tree ⋮ Inverse \(p\)-median problems with variable edge lengths ⋮ Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees ⋮ 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 ⋮ Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees ⋮ Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Inverse 1-center location problems with edge length augmentation on trees

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity analysis of the inverse center location problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network