Inverse \(p\)-median problems with variable edge lengths
From MaRDI portal
Publication:532535
DOI10.1007/s00186-011-0346-5zbMath1216.49032OpenAlexW2032381527MaRDI QIDQ532535
Fahimeh Baroughi Bonab, Elisabeth Gassner, Rainer E. Burkard
Publication date: 5 May 2011
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-011-0346-5
Related Items (46)
A fast algorithm for the rectilinear distance location problem ⋮ 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 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 ⋮ Inverse and reverse balanced facility location problems with variable edge lengths on trees ⋮ The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion ⋮ 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 ⋮ A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs ⋮ 2-balanced flows and the inverse 1-median problem in the Chebyshev space ⋮ Unnamed Item ⋮ Upgrading edges in the maximal covering location problem ⋮ Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks ⋮ Upgrading \(p\)-median problem on a path ⋮ The max-sum inverse median location problem on trees with budget constraint ⋮ Inverse median location problems with variable coordinates ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ 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 ⋮ Unnamed Item ⋮ The inverse 1-median problem on tree networks with variable real edge lengths ⋮ On some inverse 1-center location problems ⋮ The inverse 1-center problem on cycles with variable edge lengths ⋮ Algorithms for location problems based on angular distances ⋮ 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 ⋮ Classical and inverse median location problems under uncertain environment ⋮ Inverse anti-\(k\)-centrum problem on networks with variable edge lengths ⋮ Some polynomially solvable cases of the inverse ordered 1-median problem on trees ⋮ Unnamed Item ⋮ Reverse 1-center problem on weighted 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 ⋮ An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions ⋮ Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems 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 ⋮ A HYBRID ALGORITHM FOR THE UNCERTAIN INVERSE p-MEDIAN LOCATION PROBLEM
Cites Work
- Unnamed Item
- 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
- On an instance of the inverse shortest paths problem
- The complexity analysis of the inverse center location problem
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse median problems
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs
- Linear Programming in Linear Time When the Dimension Is Fixed
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Computing the 2‐median on tree networks in O(n lg n) time
- Algorithms – ESA 2005
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Inverse \(p\)-median problems with variable edge lengths
