The inverse Fermat-Weber problem
From MaRDI portal
Publication:976390
DOI10.1016/j.ejor.2010.01.046zbMath1188.90209OpenAlexW1975946049MaRDI QIDQ976390
Rainer E. Burkard, Mohammadreza Galavii, Elisabeth Gassner
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.046
Related Items (33)
Reverse 1-centre problem on trees under convex piecewise-linear cost function ⋮ The inverse connected \(p\)-median problem on block graphs under various cost functions ⋮ 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 ⋮ Mathematical models for the variable weights version of the inverse minimax circle location problem ⋮ 2-balanced flows and the inverse 1-median problem in the Chebyshev space ⋮ The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights ⋮ Upgrading \(p\)-median problem on a path ⋮ Inverse median location problems with variable coordinates ⋮ Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm ⋮ An inverse approach to convex ordered median problems in trees ⋮ Inverse 1-median problem on trees under weighted Hamming distance ⋮ Computation of inverse 1-center location problem on the weighted trapezoid graphs ⋮ The inverse 1-median problem on tree networks with variable real edge lengths ⋮ On some inverse 1-center location problems ⋮ 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 ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 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 ⋮ Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees ⋮ Optimal algorithms for selective variants of the classical and inverse median location problems on trees ⋮ Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear time algorithms for some separable quadratic programming problems
- Improving the location of minisum facilities through network modification
- The inverse 1-maxian problem with edge length modification
- Reverse 2-median problem on trees
- The inverse 1-median problem on a cycle
- On an instance of the inverse shortest paths problem
- Geometric algorithms and combinatorial optimization.
- 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
- Linear Programming in Linear Time When the Dimension Is Fixed
- Location-Allocation Problems
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Link-Length Minimization in Networks
- A linear time algorithm for the reverse 1‐median problem on a cycle
This page was built for publication: The inverse Fermat-Weber problem
