Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees

DOI10.1016/j.dam.2011.01.009zbMath1220.90104OpenAlexW2062885756MaRDI QIDQ534329

Behrooz Alizadeh, Rainer E. Burkard

Publication date: 17 May 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.01.009

zbMATH Keywords

combinatorial optimizationfacility location probleminverse optimizationabsolute and vertex 1-centers

Mathematics Subject Classification ID

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

Related Items (31)

Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ 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 ⋮ Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ A linear time algorithm for inverse obnoxious center location problems on networks ⋮ Inverse eccentric vertex problem 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 ⋮ 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 ⋮ The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm ⋮ 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 ⋮ Inverse \(k\)-centrum problem on trees with variable vertex weights ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ Inverse group 1-median problem 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 ⋮ A model for the inverse 1-median problem on trees under uncertain costs ⋮ 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-median problem on trees under mixed rectilinear and Chebyshev norms ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees ⋮ Optimal Algorithms for Inverse Eccentric Vertex Location Problem on Extended Star Networks

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• An inverse approach to convex ordered median problems in trees
• Inverse median location problems with variable coordinates
• Inverse center location problem on a tree
• The inverse 1-maxian problem with edge length modification
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees