Buscar
Mostrando ítems 1-7 de 7
Artículo
Exact procedures for solving the discrete ordered median problem
(Elsevier, 2006-11)
The Discrete Ordered Median Problem (DOMP) generalizes classical discrete location problems, such as the N-median, N-center and Uncapacitated Facility Location problems. It was introduced by Nickel [S. Nickel. Discrete ...
Artículo
Unreliable point facility location problems on networks
(Elsevier, 2014-03)
In this paper we study facility location problems on graphs under the most common criteria, such as, median, center and centdian, but we incorporate in the objective function some reliability aspects. Assuming that facilities ...
Artículo
Cooperative location games based on the minimum diameter spanning Steiner subgraph problem
(Elsevier, 2012-05)
In this paper we introduce and analyze new classes of cooperative games related to facility location models. The players are the customers (demand points) in the location problem and the characteristic value of a coalition ...
Artículo
Modelos de localización continua
(Sociedad Española de Matemática Aplicada, 2004)
En este trabajo se revisan tres modelos de problemas de localización continua: (1) un problema general de localización con respecto a regiones de demanda; (2) el problema de la mediana ordenada y (3) un problema ...
Artículo
The continuous and discrete path variance problem on trees
(Wiley, 2009-03)
In this paper we consider the problem of locating path-shaped facilities on a tree minimizing the variance objective function. This kind of objective function is generally adopted in location problems which arise in the ...
Artículo
Averaging the k largest distances among n: k-centra in Banach spaces
(Elsevier, 2004-03-15)
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 ...
Artículo
The bi-criteria doubly weighted center-median path problem on a tree
(Wiley, 2006-07)
Given a tree network T with n nodes, let PL be the subset of all discrete paths whose length is bounded above by a prespecified value L. We consider the location of a path-shaped facility P ∈ PL, where customers are represented ...