Buscar
Mostrando ítems 1-6 de 6
Artículo
On Covering Methods for D.C. Optimization
(Springer, 2000-11-01)
Covering methods constitute a broad class of algorithms for solving multivariate Global Optimization problems. In this note we show that, when the objective f is d.c. and a d.c. decomposition for f is known, the computational ...
Artículo
Solving nonconvex planar location problems by nite dominating sets
(Springer, 2000-10)
It is well-known that some of the classical location problems with polyhedral gauges can be solved in polynomial time by nding a fi nite dominating set, i.e. a finite set of candidates guaranteed to contain at least one ...
Artículo
Análisis de sensibilidad en el muestreo en poblaciones finitas
(Universidad de Salamanca, 2000)
Las conclusiones de un análisis estadístico dependen en gran medida de las hipótesis de partida, en general expresadas en términos de un modelo, y de las observaciones experimentales. Esta dependencia motiva la necesidad ...
Artículo
Optimization of the Norm of a Vector-Valued DC Function and Applications
(Springer, 2000-11-01)
In this paper, we show that a DC representation can be obtained explicitly for the composition of a gauge with a DC mapping, so that the optimization of certain functions involving terms of this kind can be made by using ...
Artículo
Dominators for multiple-objective quasiconvex maximization problems
(Springer, 2000-01-06)
In this paper we address the problem of finding a dominator for a multiple-objective maximization problem with quasiconvex functions. The one-dimensional case is discussed in some detail, showing how a Branch-and-Bound ...
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 ...