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
Cites work
- scientific article; zbMATH DE number 3542180 (Why is no real title available?)
- scientific article; zbMATH DE number 1253040 (Why is no real title available?)
- scientific article; zbMATH DE number 1094753 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 3027356 (Why is no real title available?)
- A linear time algorithm for the reverse 1‐median problem on a cycle
- Geometric algorithms and combinatorial optimization.
- Improving the location of minisum facilities through network modification
- Inverse combinatorial optimization: a survey on problems, methods, and results
- Inverse median problems
- Linear Programming in Linear Time When the Dimension Is Fixed
- Linear time algorithms for some separable quadratic programming problems
- Link-Length Minimization in Networks
- Location-Allocation Problems
- On an instance of the inverse shortest paths problem
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- Reverse 2-median problem on trees
- Some reverse location problems
- The complexity analysis of the inverse center location problem
- The inverse 1-maxian problem with edge length modification
- The inverse 1-median problem on a cycle
Cited in
(37)- The inverse connected p-median problem on block graphs under various cost functions
- Computation of inverse 1-center location problem on the weighted trapezoid graphs
- The 1-median problem in \(\mathbb{R}^d\) with the Chebyshev-norm and its inverse problem
- 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
- The inverse 1-median problem on tree networks with variable real edge lengths
- Inverse group 1-median problem on trees
- Mathematical models for the variable weights version of the inverse minimax circle location problem
- A linear time algorithm for inverse obnoxious center location problems on networks
- Inverse quickest center location problem on a tree
- The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance
- Tropical Fermat-Weber points
- An inverse approach to convex ordered median problems in trees
- Inverse 1-median problem on trees under weighted Hamming distance
- Inverse \(k\)-centrum problem on trees with variable vertex weights
- A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms
- 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)
