Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees

DOI10.1002/net.20427zbMath1236.90094OpenAlexW2083011423MaRDI QIDQ3100698

Rainer E. Burkard, Behrooz Alizadeh

Publication date: 21 November 2011

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20427

zbMATH Keywords

combinatorial optimizationdesign of algorithmsinverse optimizationnetwork center location

Mathematics Subject Classification ID

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

Related Items

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 ⋮ A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint ⋮ 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 and reverse balanced facility location problems with variable edge lengths on trees ⋮ 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 ⋮ Unnamed Item ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Inverse median location problems with variable coordinates ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ 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 ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Unnamed Item ⋮ On some inverse 1-center location problems ⋮ Resource allocation in rooted trees for VLSI applications ⋮ 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 quickest center location problem on a tree ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ The minmax regret inverse maximum weight problem ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ 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 single facility location problem on a tree with balancing on the distance of server to clients ⋮ Inverse 1-center location problems with edge length augmentation on trees ⋮ 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

• Knapsack
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An inverse approach to convex ordered median problems in trees
• 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
• On dual minimum cost flow algorithms
• Some reverse location problems
• The complexity analysis of the inverse center location problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse median problems
• Finding the optimal solution to the Huff based competitive location model
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithm for Large Zero-One Knapsack Problems