The inverse Fermat-Weber problem

DOI10.1016/J.EJOR.2010.01.046zbMATH Open1188.90209OpenAlexW1975946049MaRDI QIDQ976390FDOQ976390

Authors: 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

Recommendations

• On the inverse Fermat equation
• scientific article; zbMATH DE number 7564649
• scientific article; zbMATH DE number 3207390
• On an inverse problem to Frobenius' theorem.
• A generalization of Fermat's problem revisited
• The inverse Banzhaf problem
• scientific article; zbMATH DE number 1076793
• scientific article; zbMATH DE number 18540
• On an inverse problem in additive number theory
• Problème inverse de Galois et nombres réciproques

zbMATH Keywords

linear programmingcombinatorial optimizationlocation

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
• Title not available (Why is that?)
• Geometric algorithms and combinatorial optimization.
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Location-Allocation Problems
• Link-Length Minimization in Networks
• Linear Programming in Linear Time When the Dimension Is Fixed
• The complexity analysis of the inverse center location problem
• Inverse median problems
• The inverse 1-median problem on a cycle
• The inverse 1-maxian problem with edge length modification
• On an instance of the inverse shortest paths problem
• Linear time algorithms for some separable quadratic programming problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Some reverse location problems
• Reverse 2-median problem on trees
• Improving the location of minisum facilities through network modification
• A linear time algorithm for the reverse 1‐median problem on a cycle

Cited In (37)

• The 1-median problem in \(\mathbb{R}^d\) with the Chebyshev-norm and its inverse problem
• Computation of inverse 1-center location problem on the weighted trapezoid graphs
• The inverse connected \(p\)-median problem on block graphs under various cost functions
• Inverse anti-\(k\)-centrum problem on networks with variable edge lengths
• On the inverse Fermat equation
• On the Fermat-Weber point of a polygonal chain and its generalizations
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees
• Linear time optimal approaches for MAX-profit inverse 1-Mmdian location problems
• Mathematical models for the variable weights version of the inverse minimax circle location problem
• Inverse group 1-median problem on trees
• The inverse 1-median problem on tree networks with variable real edge lengths
• Tropical Fermat-Weber points
• Inverse quickest center location problem on a tree
• 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
• An inverse approach to convex ordered median problems in trees
• Inverse 1-median problem on trees under weighted Hamming distance
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
• Inverse \(k\)-centrum problem on trees with variable vertex weights
• Inverse \(p\)-median problems with variable edge lengths
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees
• 2-balanced flows and the inverse 1-median problem in the Chebyshev space
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• Reverse 1-centre problem on trees under convex piecewise-linear cost function
• Vertex quickest 1-center location problem on trees and its inverse problem under weighted \(l_\infty\) norm
• Inverse median location problems with variable coordinates
• An \(\mathcal{O}(n \log n)\) algorithm for the inverse 1-median problem on trees with variable vertex weights and edge reductions
• Upgrading \(p\)-median problem on a path
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights
• The inverse 1-median problem on a tree and on a path
• Robust reverse 1-center problems on trees with interval costs
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees
• Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
• On some inverse 1-center location problems
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

This page was built for publication: The inverse Fermat-Weber problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976390)