Related papers: Single-facility Weber Location Problem based on th…
It is known that the set of all solutions of a commutant lifting and other interpolation problems admits a Redheffer linear-fractional parametrization. The method of unitary coupling identifies solutions of the lifting problem with minimal…
The problem of search by multiple agents to find and localize objects arises in many important applications. In this paper, we study a class of multi-agent search problems in which each agent can access only a subset of a discrete search…
We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space…
Facility location is a prominent optimization problem that has inspired a large quantity of both theoretical and practical studies in combinatorial optimization. Although the problem has been investigated under various settings reflecting…
We consider location problems to find the optimal sites of placement of a new facility, which minimize the maximum weighted Chebyshev or rectilinear distance to existing facilities under constraints on a feasible location domain. We examine…
Point source localisation is generally modelled as a Lasso-type problem on measures. However, optimisation methods in non-Hilbert spaces, such as the space of Radon measures, are much less developed than in Hilbert spaces. Most numerical…
In this paper, we introduce a new variant of the $p$-median facility location problem in which it is assumed that the exact location of the potential facilities is unknown. Instead, each of the facilities must be located in a region around…
This paper investigates first-order variable metric backward forward dynamical systems associated with monotone inclusion and convex minimization problems in real Hilbert space. The operators are chosen so that the backward-forward…
The facility location problem is an NP-hard optimization problem. Therefore, approximation algorithms are often used to solve large instances. Such algorithms often perform much better than worst-case analysis suggests. Therefore,…
Both unconstrained and constrained minimax single facility location problems are considered in multidimensional space with Chebyshev distance. A new solution approach is proposed within the framework of idempotent algebra to reduce the…
We give a new randomized LP-rounding 1.725-approximation algorithm for the metric Fault-Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithm of Swamy & Shmoys. To the…
The matrix rank minimization problem has applications in many fields such as system identification, optimal control, low-dimensional embedding, etc. As this problem is NP-hard in general, its convex relaxation, the nuclear norm minimization…
We can obtain one solution of the Hamiltonian constraint equation in the local sense. The form of the state is suggested from the up-to-down method in our previous work. The up-to-down method works for different way in treating the general…
The Maximal Covering Location Problem (MCLP) represents a fundamental optimization challenge in facility location theory, where the objective is to maximize demand coverage while operating under resource constraints. This paper presents a…
Problems of quadratic optimization in Hilbert space often arise when solving ill-posed problems for differential equations. In this case, the target value of the functional is known. In addition, the structure of the functional allows…
We present a scalable solution to link entities across mobility datasets using their spatio-temporal information. This is a fundamental problem in many applications such as linking user identities for security, understanding privacy…
Most algorithms for solving optimization problems or finding saddle points of convex-concave functions are fixed-point algorithms. In this work we consider the generic problem of finding a fixed point of an average of operators, or an…
We study a joint facility location and cost planning problem in a competitive market under random utility maximization (RUM) models. The objective is to locate new facilities and make decisions on the costs (or budgets) to spend on the new…
Multidimensional minimax single facility location problems with Chebyshev distance are examined within the framework of idempotent algebra. A new algebraic solution based on an extremal property of the eigenvalues of irreducible matrices is…
The problem considered in this paper is the weighted obnoxious facility location in the convex hull of demand points. The objective function is to maximize the smallest weighted distance between a facility and a set of demand points. Three…