Inverse 1-center location problems with edge length augmentation on trees
From MaRDI portal
Publication:1044223
DOI10.1007/s00607-009-0070-7zbMath1180.90163OpenAlexW2098312227WikidataQ61638345 ScholiaQ61638345MaRDI QIDQ1044223
Behrooz Alizadeh, Rainer E. Burkard, Ulrich Pferschy
Publication date: 11 December 2009
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-009-0070-7
Continuous location (90B85) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Inverse center location problems ⋮ On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks ⋮ 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 ⋮ Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ 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 ⋮ 2-balanced flows and the inverse 1-median problem in the Chebyshev space ⋮ Unnamed Item ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Inverse median location problems with variable coordinates ⋮ Variable-sized uncertainty and inverse problems in robust optimization ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ Unnamed Item ⋮ 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 quickest center location problem on a tree ⋮ Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ 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 ⋮ 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-median problem on trees under mixed rectilinear and Chebyshev norms ⋮ Assigning weights to minimize the covering radius in the plane ⋮ 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
Cites Work
- 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 complexity analysis of the inverse center location problem
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse median problems
- Some inverse optimization problems under the Hamming distance
- Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
- Location Theory
- An Algorithm for Large Zero-One Knapsack Problems
- Inverse Bottleneck Optimization Problems on Networks
