Buscar
Mostrando ítems 1-10 de 23
Artículo
The determination of a "least quantile of squares regression line" for all quantiles
(Elsevier Science, 1994-09-01)
Least median of squares regression has shown to be an extremely useful tool in robust regression analysis. In this note, we extend this concept to least quantile of squares regression, and propose a polynomial algorithm ...
Artículo
A discretizing algorithm for location problems
(ELSEVIER SCIENCE BV, 1995)
A new and simple methodology is proposed to solve both constrained and unconstrained planar continuous single-facility location problems. As particular instances, the classical location problems with mixed gauges can be ...
Tesis Doctoral
Problemas de localización multiobjetivo
(1992)
El objetivo del presente trabajo es el estudio de ciertos aspectos del problema multiobjetivo P (A, S) cuando el conjunto factible S es un subconjunto Rn.Los modelos de loc alización de un servicio llevan asociados de ...
Artículo
Locating an undesirable facility by generalized cutting planes
(Informs, 1998-08-03)
We address the problem of locating an undesirable facility within a compact set by minimizing a strictly decreasing boundedly lower subdifferentiable function of the squared Euclidean distances to a set of fixed points. ...
Tesis Doctoral
Artículo
Multi-criteria analysis with partial information about the weighting coefficients
(ELSEVIER SCIENCE BV, 1993-04-01)
In this paper we address the problem of ranking a set of alternatives with partial information about the weighting coefficients. We introduce a family of quasiorders that are easily interpretable and manageable, which ...
Artículo
Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints
(Springer, 1998-12-01)
A location is sought within some convex region of the plane for the central site of some public service to a finite number of demand points. The parametric maxcovering problem consists in finding for eachR>0 the point from ...
Artículo
Location and shape of a rectangular facility in ℝn. Convexity properties. Convexity properties
(Springer, 1998-01-01)
In this paper we address a generalization of the Weber problem, in which we seek for the center and the shape of a rectangle (the facility) minimizing the average distance to a given set (the demand-set) which is not assumed ...
Artículo
A characterization of efficient points in constrained location problems with regional demand
(ELSEVIER SCIENCE BV, 1996-02-01)
In this paper we characterize the set of efficient points in the planar point-objective location problem under a convex locational constraint, when distances are measured by a strictly convex norm in ~2 and the set of ...
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 ...