An inverse approach to convex ordered median problems in trees

DOI10.1007/S10878-010-9353-3zbMath1243.90223OpenAlexW2094083920MaRDI QIDQ421273

Elisabeth Gassner

Publication date: 23 May 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9353-3

zbMATH Keywords

location problemcomplexity analysisinverse optimizationordered median\(k\)-centrum

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (24)

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 inverse obnoxious center location problems on networks ⋮ The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance ⋮ Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance ⋮ Upgrading edges in the maximal covering location problem ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ 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 ⋮ On some inverse 1-center location problems ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ 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 ⋮ 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 ⋮ Inverse group 1-median problem on trees ⋮ 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 ⋮ The ordered \(k\)-median problem: surrogate models and approximation algorithms ⋮ Inverse 1-center location problems with edge length augmentation on trees ⋮ Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms

Cites Work

• Unnamed Item
• The inverse 1-maxian problem with edge length modification
• The inverse 1-median problem on a cycle
• The inverse Fermat-Weber problem
• The complexity analysis of the inverse center location problem
• Algorithmic results for ordered median problems
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse median problems
• Location Theory
• The \(k\)-centrum multi-facility location problem

This page was built for publication: An inverse approach to convex ordered median problems in trees