Buscar
Mostrando ítems 51-60 de 103
Artículo
Revisiting several problems and algorithms in continuous location with lp norms
(Springer, 2014-07)
This paper addresses the general continuous single facility location problems in finite dimension spaces under possibly different ℓp norms in the demand points. We analyze the difficulty of this family of problems and ...
Artículo
The generalized Weber problem with expected distances
(EDP Sciences, 1995-09)
In this paper we study a generalized Weber problem where both demand locations and the facility to be located may be regions and to be assumed to be distributed according to some probability measures inside each region. A ...
Artículo
Avoiding unfairness of Owen allocations in linear production processes
(Elsevier, 2012-07-01)
This paper deals with cooperation situations in linear production problems in which a set of goods are to be produced from a set of resources so that a certain benefit function is maximized, assuming that resources not ...
Artículo
Revisiting a game theoretic framework for the robust railway network design against intentional attacks
(Elsevier, 2013-04-16)
This paper discusses and extends some competitive aspects of the games proposed in an earlier work, where a robust railway network design problem was proposed as a non-cooperative zero-sum game in normal form between a ...
Artículo
The continuous and discrete path variance problem on trees
(Wiley, 2009-03)
In this paper we consider the problem of locating path-shaped facilities on a tree minimizing the variance objective function. This kind of objective function is generally adopted in location problems which arise in the ...
Tesis Doctoral
Avances sobre el problema de localización continua de un único centro
(1998)
"El objetivo de la Teoría de la Localización consiste en determinar una o varias localizaciones para uno o más servicios con respecto a un conjunto de ubicaciones conocidas a priori, que usualmente denominamos puntos de ...
Artículo
Averaging the k largest distances among n: k-centra in Banach spaces
(Elsevier, 2004-03-15)
Given a Banach space X let A ⊂ X containing at least k points. In location theory, reliability analysis, and theoretical computer science, it is useful to minimize the sum of distances from the k furthest points of A: this ...
Artículo
A mathematical programming approach to SVM-based classification with label noise
(ScienceDirect, 2022-08-30)
In this paper we propose novel methodologies to optimally construct Support Vector Machine-based classifiers that take into account that label noise occur in the training sample. We propose different alternatives based on ...
Artículo
A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
(informs, 2020-01-07)
The discrete ordered median problem (DOMP) is formulated as a set-partitioning problem using an exponential number of variables. Each variable corresponds to a set of demand points allocated to the same facility with the ...
Artículo
Single facility location problems with unbounded unit balls
(Springer Verlag (Germany), 2003)