Buscar
Mostrando ítems 1-10 de 10
Artículo
A mathematical programming approach to overlapping community detection
(Elsevier, 2022-06-02)
We propose a new optimization model to detect overlapping communities in networks. The model elaborates suggestions contained in Zhang et al. (2007), in which overlapping communities were identified through the use of a ...
Artículo
Robust positioning of service units
(Taylor & Francis, 2003)
In this paper, we address the problem of locating mobile service units to cover random incidents. The model does not assume complete knowledge of the probability distribution of the location of the incident to be covered. ...
Artículo
Segmentation of scanning-transmission electron microscopy images using the ordered median problem
(Elsevier, 2022-01-15)
This paper presents new models for segmentation of 2D and 3D Scanning-Transmission Electron Micro- scope images based on the ordered median function. The main advantage of using this function is its good adaptability to ...
Artículo
On the exponential cardinality of FDS for the ordered p-median problem
(Elsevier, 2005)
We study finite dominating sets (FDS) for the ordered median problem. This kind of problems allows to deal simultaneously with a large number of models. We show that there is no valid polynomial size FDS for the general ...
Artículo
Ordered median hub location problems with capacity constraints
(Elsevier, 2015-06-15)
The Single Allocation Ordered Median Hub Location problem is a recent hub model introduced in [36] J. Puerto, A.B. Ramos, and A.M. Rodríguez-Chía. Single-Allocation Ordered Median Hub Location Problems. Computers and ...
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 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 ...
Artículo
New results on minimax regret single facility ordered median location problems on networks
(Springer, 2007)
We consider the single facility ordered median location problem with uncertainty in the parameters (weights) defining the objective function. We study two cases. In the first case the uncertain weights belong to a region ...
Artículo
A flexible approach to location problems
(Springer, 2000-02)
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 ...
Artículo
A comparison of formulations and solution methods for the minimum-envy location problem. Additional results
(2008)
We consider a discrete facility location problem with a new form of equity criterion. The model discussed in the paper analyzes the case where demand points only have strict preference order on the sites where the plants ...