Buscar
Mostrando ítems 41-50 de 144
Artículo
Solving the median problem with continuous demand on a network
(Springer, 2013-12)
Where to locate one or several facilities on a network so as to minimize the expected users-closest facility transportation cost is a problem well studied in the OR literature under the name of median problem. In the median ...
Artículo
Improving Interval Analysis Bounds by Translations
(Springer, 2003-08-26)
We explore how a simple linear change of variable affects the inclusion functions obtained with Interval Analysis methods. Univariate and multivariate polynomial test functions are considered, showing that translation-based ...
Artículo
On Extreme Concentrations in Chemical Reaction Networks with Incomplete Measurements
(ACS, 2016-11-09)
A fundamental problem in the analysis of chemical reactions networks consists of identifying concentration values along time or in steady state which are coherent with the experimental concentration data available. When ...
Artículo
Maximin location: discretization not always works
(Springer, 1998-01-01)
In this note we show by means of a simple example that, if the maximin problem with (nonlinear) concave increasing utility functions is solved by inspecting the extreme points of the (generalized) Voronoi diagram (as usually ...
Artículo
Supervised classification and mathematical optimization
(Elsevier, 2013-01)
Data Mining techniques often ask for the resolution of optimization problems. Supervised Classification, and, in particular, Support Vector Machines, can be seen as a paradigmatic instance. In this paper, some links between ...
Artículo
Interpreting clusters via prototype optimization
(Elsevier, 2021)
In this paper, we tackle the problem of enhancing the interpretability of the results of Cluster Analy sis. Our goal is to find an explanation for each cluster, such that clusters are characterized as precisely and ...
Artículo
Undesirable facility location with minimal covering objectives
(ELSEVIER SCIENCE BV, 1999-11-19)
An undesirable facility is to be located within some feasible region of any shape in the plane or on a planar network. Population is supposed to be concentrated at a finite number n of points. Two criteria are taken into ...
Artículo
A computational study of a nonlinear minsum facility location problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2012-01-31)
A discrete location problem with nonlinear objective is addressed. A set of p plants is to be open to serve a given set of clients. Together with the locations, the number p of facilities is also a decision variable. The ...
Artículo
Locating a competitive facility in the plane with a robustness criterion
(Elsevier, 2011-11-16)
A new continuous location model is presented and embedded in the literature on robustness in facility location. The multimodality of the model is investigated, and a branch and bound method based on dc optimization is ...
Artículo
Variable neighborhood search for minimum sum-of-squares clustering on networks
(ELSEVIER SCIENCE BV, 2013-10-13)
Euclidean Minimum Sum-of-Squares Clustering amounts to finding p prototypes by minimizing the sum of the squared Euclidean distances from a set of points to their closest prototype. In recent years related clustering ...