Buscar
Mostrando ítems 21-30 de 33
Artículo
Different numerical methods in the study of passive scalar transport in a pipeline x-junction
(ELSEVIER SCIENCE BV, 2009-01-01)
A computational fluid dynamic model is used to analyze the transport processes of a passive scalar generated in the mixing of two fluids or flows in a pipeline x-junction. Turbulent flow field is computed for the merging ...
Artículo
Multi-group support vector machines with measurement costs a biobjective approach
(Elsevier, 2008-03)
Support Vector Machine has shown to have good performance in many practical classification settings. In this paper we propose, for multi-group classification, a biobjective optimization model in which we consider not only ...
Artículo
Deriving Weights in Multiple-Criteria Decision Making with Support Vector Machines
(Springer, 2006-01-01)
A key problem in Multiple-Criteria Decision Making is how to measure the importance of the different criteria when just a partial preference relation among actions is given. In this note we address the problem of ...
Artículo
Optimal location and design of a competitive facility
(Springer, 2004-06)
A single facility has to be located in competition with fixed existing facilities of similar type. Demand is supposed to be concentrated at a finite number of points, and consumers patronise the facility to which they are ...
Artículo
On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification
(Informs, 2007-07-20)
The nearest-neighbor classifier has been shown to be a powerful tool for multiclass classification. We explore both theoretical properties and empirical behavior of a variant method, in which the nearest-neighbor rule is ...
Artículo
Continuous location problems and Big Triangle Small Triangle: constructing better bounds
(Springer, 2009-11)
The Big Triangle Small Triangle method has shown to be a powerful global optimization procedure to address continuous location problems. In the paper published in J. Global Optim. (37:305–319, 2007), Drezner proposes a ...
Artículo
Generalized goal programming: polynomial methods and applications
(Springer, 2002-12)
In this paper we address a general Goal Programming problem with linear objectives, convex constraints, and an arbitrary componentwise nondecreasing norm to aggregate deviations with respect to targets. In particular, ...
Artículo
An Exact Method for Fractional Goal Programming
(Springer, 2004-01-04)
Goal Programming with fractional objectives can be reduced to mathematical programming with a linear objective under linear and quadratic constraints, thus optimal solutions can be obtained by using existing Global ...
Artículo
Finding GM-estimators with global optimization techniques
(Springer, 2001-01-01)
In this note we address the problem of finding the GM-estimator for the location parameter of a univariate random variable. When this problem is non-convex but d.c. one can use a standard covering method, which, in the ...
Artículo
An optimal bound for d.c. programs with convex constraints
(Springer, 2001-04-01)
A well-known strategy for obtaining a lower bound on the minimum of a d.c. function f−g over a compact convex set S⊂ℝn consists of replacing the convex function f by a linear minorant at x 0∈S. In this note we show that ...