相关论文: The Fermat-Torricelli Problem and Weiszfeld's Algo…

We find the equations that allow us to compute the position of the two interior nodes (weighted Fermat-Torricelli points) w.r. to the weighted Steiner problem for four points determining a tetrahedron in R^3. Furthermore, by applying the…

We pose and study the Fermat-Torricelli problem for a triangle in the projective plane under the sine distance. Our main finding is that if every side of the triangle has length greater than $\sin 60^\circ$, then the Fermat-Torricelli point…

We suggest a new optimization technique for minimizing the sum $\sum_{i=1}^n f_i(x)$ of $n$ non-convex real functions that satisfy a property that we call piecewise log-Lipschitz. This is by forging links between techniques in computational…

We prove the following fundamental property for the Fermat-Torricelli point for four non-collinear and non-coplanar points forming a tetrahedron in $\mathbb{R}^{3},$ which states that: The three bisecting lines having as a common vertex the…

We present a class of explicit solutions for the problem of minimization of the function $f(x,y,z)=\sum_{i=1}^{4}\sqrt{(x-x_{i})^2+(y-y_{i})^2+(z-z_{i})^2},$ which gives the location of the unique stationary (Fermat-Torricelli) point for…

We present explicit analytical solution for the problem of minimization of the function $ F(x,y)= \sum_{j=1}^3 m_j \sqrt{(x-x_j)^2+(y-y_j)^2} $, i.e. we find the coordinates of stationary point and the corresponding critical value of $…

The transportation problem in the plane - how to move a set of objects from one set of points to another set of points in the cheapest way - is a very old problem going back several hundreds of years. In recent years the solution of the…

We obtain an important generalization of the inverse weighted Fermat-Torricelli problem for tetrahedra in R^3 by assigning at the corresponding weighted Fermat-Torricelli point a remaining positive number (residual weight). As a…

In this paper, we study the problem of finding the Euclidean distance to a convex cone generated by a set of discrete points in $\mathbb{R}^n_+$. In particular, we are interested in problems where the discrete points are the set of feasible…

The traveling salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing…

In this paper we study a generalized version of the Weber problem of finding a point that minimizes the sum of its distances to a finite number of given points. In our setting these distances may be $cut$ $off$ at a given value $C > 0$, and…

In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…

The classical Heron problem states: \emph{on a given straight line in the plane, find a point $C$ such that the sum of the distances from $C$ to the given points $A$ and $B$ is minimal}. This problem can be solved using standard geometry or…

The Fermat-Steiner problem consists in finding all points in a metric space $Y$ such that the sum of distances from each of them to the points from some fixed finite subset of $Y$ is minimal. This problem is investigated for the metric…

Suppose we are given two metric spaces and a family of continuous transformations from one to the other. Given a probability distribution on each of these two spaces - namely the source and the target measures - the Wasserstein alignment…

The Tammes problem is to find the arrangement of N points on a unit sphere which maximizes the minimum distance between any two points. This problem is presently solved for several values of N, namely for N=3,4,6,12 by L. Fejes Toth (1943);…

In this paper we develop algorithms to solve generalized weighted Fermat-Torricelli problems with positive and negative weights and multifacility location problems involving distances generated by Minkowski gauges. We also introduce a new…

In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…

This paper proposes a convex approach to the Frisch-Kalman problem that identifies the linear relations among variables from noisy observations. The problem was proposed by Ragnar Frisch in 1930s, and was promoted and further developed by…

We discuss two versions of the Fr\'echet distance problem in weighted planar subdivisions. In the first one, the distance between two points is the weighted length of the line segment joining the points. In the second one, the distance…