10 research outputs found
Averaging the k largest distances among n: k-centra in Banach spaces
Given a Banach space X let A ⊂ X containing at least k points. In location theory, reliability analysis, and theoretical computer science, it is useful to minimize the sum of distances from the k furthest points of A: this problem has received some attention for X a finite metric space (a network), see, e.g., [Discrete Appl. Math. 109 (2001) 293]; in the case X = En, k = 2 or 3, and A compact some results have been given in [Math. Notes 59 (1996) 507]; also, in the field of theoretical computer science it has been considered in [T. Tokuyama, Minimax parametric optimization problems in multidimensional parametric searching, in: Proc. 33rd Annu. ACM Symp. on Theory of Computing, 2001, pp. 75–84]. Here we study the above problem for a finite set A ⊂ X, generalizing—among others things—the results in [Math. Notes 59 (1996) 507].Ministerio de Ciencia y TecnologÃ
Multifacility ordered median problems on networks: a further analysis
In this paper, we address the ordered p-median problem, which includes as special cases most of the classical multifacility location problems discussed in the literature. Finite dominating sets (FDS) are known for particular instances of this problem: p-median, p-center, and p-centdian. We find an FDS for the ordered p-median problem. This set allows us to gain a better insight into the general FDS structure of network location problems. This FDS is later used to present the first polynomial time algorithm for p-facility ordered median problems on tree networks
Continuous multifacility ordered median location problems
In this paper we propose a general methodology for solving a broad class of continuous, multifacility location problems, in any dimension and with â„“Ï„ -norms proposing two different methodologies: 1) by a new second order cone mixed integer programming formulation and 2) by formulating a sequence of semidefinite programs that converges to the solution of the problem; each of these relaxed problems solvable with SDP solvers in polynomial time. We apply dimensionality reductions of the problems by sparsity and symmetry in order to be able to solve larger problems.
Continuous multifacility location and Ordered median problems and Semidefinite programming and Moment problem.Junta de AndalucÃaFondo Europeo de Desarrollo RegionalMinisterio de Ciencia e Innovació
A flexible approach to location problems
In continous location problems we are given a set of existing facilities and we are looking for the location of one or several new facilities. In the classical approaches weights are assigned to existing facilities expressing the importance of the new facilities for the existing ones. In this paper, we consider a pointwise defined objective function where the weights are assigned to the existing facilities depending on the location of the new facility. This approach is shown to be a generalization of the median, center and centdian objective functions. In addition, this approach allows to formulate completely new location models. Efficient algorithms as well as structure results for this algebraic approach for location problems are presented. Extensions to the multifacility and restricted case are also considered
A flexible approach to location problems
When dealing with location problems we are usually given a set of
existing facilities and we are looking for the location of one or several new
facilities. In the classical approaches weights are assigned to existing facilities expressing the importance of the new facilities for the existing ones.
In this paper, we consider a pointwise de®ned objective function where the
weights are assigned to the existing facilities depending on the location of the new facility. This approach is shown to be a generalization of the median, center and centdian objective functions. In addition, this approach allows the formulation of completely new location models. Efficient algorithms as well as structural results for this algebraic approach to location problems are presented. A complexity analysis and extensions to the multifacility and restricted case are also considered.Ministerio de Educación y Cultur
A flexible approach to location problems
In continous location problems we are given a set of existing facilities and we are looking for the location of one or several new facilities. In the classical approaches weights are assigned to existing facilities expressing the importance of the new facilities for the existing ones. In this paper, we consider a pointwise defined objective function where the weights are assigned to the existing facilities depending on the location of the new facility. This approach is shown to be a generalization of the median, center and centdian objective functions. In addition, this approach allows to formulate completely new location models. Efficient algorithms as well as structure results for this algebraic approach for location problems are presented. Extensions to the multifacility and restricted case are also considered