Buscar
Mostrando ítems 1-10 de 35
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
Maximal covering location problems on networks with regional demand
(Elsevier, 2016-10)
Covering problems are well studied in the Operations Research literature under the assumption that both the set of users and the set of potential facilities are finite. In this paper we address the following variant, which ...
Artículo
A DC biobjective location model
(Springer, 2002)
In this paper we address the biobjective problem of locating a semiobnoxious facility, that must provide service to a given set of demand points and, at the same time, has some negative effect on given regions in the ...
Artículo
On sparse optimal regression trees
(Elsevier, 2021-12-18)
In this paper, we model an optimal regression tree through a continuous optimization problem, where a compromise between prediction accuracy and both types of sparsity, namely local and global, is sought. Our approach can ...
Tesis Doctoral
Enhancing Classification and Regression Tree-Based Models by means of Mathematical Optimization
(2022-12-19)
This PhD dissertation bridges the disciplines of Operations Research and Machine Learning by developing novel Mathematical Optimization formulations and numerical solution approaches to build classification and regression ...
Tesis Doctoral
Artículo
p-facility Huff location problem on networks
(Elsevier, 2016-11-16)
The p-facility Huff location problem aims at locating facilities on a competitive environment so as to maximize the market share. While it has been deeply studied in the field of continuous location, in this paper we study ...
Artículo
Solving the median problem with continuous demand on a network
(Springer, 2013-12)
Where to locate one or several facilities on a network so as to minimize the expected users-closest facility transportation cost is a problem well studied in the OR literature under the name of median problem. In the median ...
Artículo
On Extreme Concentrations in Chemical Reaction Networks with Incomplete Measurements
(ACS, 2016-11-09)
A fundamental problem in the analysis of chemical reactions networks consists of identifying concentration values along time or in steady state which are coherent with the experimental concentration data available. When ...
Artículo
Locating a competitive facility in the plane with a robustness criterion
(Elsevier, 2011-11-16)
A new continuous location model is presented and embedded in the literature on robustness in facility location. The multimodality of the model is investigated, and a branch and bound method based on dc optimization is ...