Buscar
Mostrando ítems 1-10 de 16
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
Minmax-distance approximation and separation problems: geometrical properties
(Springer, 2010-04-01)
A center hyperplane in the d-dimensional space minimizes the maximum of its distances from a finite set of points A with respect to possibly different gauges. In this note it is shown that a center hyperplane exists which ...
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. ...
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
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
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
Gauge Distances and Median Hyperplanes
(Springer, 2001-01-01)
A median hyperplane in d-dimensional space minimizes the weighted sum of the distances from a finite set of points to it. When the distances from these points are measured by possibly different gauges, we prove the ...
Artículo
Alternating local search based VNS for linear classification
(Springer, 2010-02)
We consider the linear classification method consisting of separating two sets of points in d-space by a hyperplane. We wish to determine the hyperplane which minimises the sum of distances from all misclassified points ...
Artículo
Optimal expected-distance separating halfspace
(INFORMS (Institute for Operations Research and Management Sciences), 2008-08)
One recently proposed criterion to separate two datasets in discriminant analysis, is to use a hyperplane which minimises the sum of distances to it from all the misclassified data points. Here all distances are supposed ...
Artículo
Locating a semi-obnoxious covering facility with repelling polygonal regions
(ELSEVIER SCIENCE BV, 2013-11-01)
A facility is to be located in the Euclidean plane to serve certain sites by covering them closely. Simultaneously, a set of polygonal areas must be protected from the negative effects from that facility. The problem is ...