Buscar
Mostrando ítems 1-10 de 17
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Constraint relaxation for the discrete ordered median problem
(Springer, 2022-12-18)
This paper compares different exact approaches to solve the Discrete Ordered Median Problem (DOMP). In recent years, DOMP has been formulated using set packing constraints giving rise to one of its most promising formulations. ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
On hub location problems in geographically flexible networks
(Wiley, 2021-04-30)
In this paper, we propose an extension of the uncapacitated hub location problem where the potential posi-tions of the hubs are not fixed in advance. Instead, they are allowed to belong to a region around an initialdiscrete ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
The effect of consolidated periods in heterogeneous lotsizing games
(Springer, 2022)
We consider a cooperative game defined by an economic lot-sizing problem with heterogeneous costs over a finite time horizon, in which each firm faces demand for a single product in each period and coalitions can pool ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Dynamically second-preferred p-center problem
(Elsevier, 2023)
This paper deals with the Dynamically Second-preferred p-center Problem (DSpP). In this problem, cus- tomers’ preferences and subsets of sites that each customer is willing to accept as service centers are taken into ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A mathematical programming approach to overlapping community detection
(Elsevier, 2022-06-02)
We propose a new optimization model to detect overlapping communities in networks. The model elaborates suggestions contained in Zhang et al. (2007), in which overlapping communities were identified through the use of a ...
Tesis Doctoral
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Conic programming for routing and location problems
(2024-01-19)
Esta tesis doctoral desarrolla nuevos problemas en el campo de los modelos de transporte, con una perspectiva orientada al uso de drones. En este trabajo se definen nuevos modelos de transporte, tomando ciertos elementos ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Segmentation of scanning-transmission electron microscopy images using the ordered median problem
(Elsevier, 2022-01-15)
This paper presents new models for segmentation of 2D and 3D Scanning-Transmission Electron Micro- scope images based on the ordered median function. The main advantage of using this function is its good adaptability to ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Two-phase strategies for the bi-objective minimum spanning tree problem
(Wiley, 2022-01-12)
This paper presents a new two-phase algorithm for the bi-objective minimum spanning tree (BMST) prob-lem. In the first phase, it computes the extreme supported efficient solutions resorting to both mathematicalprogramming ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
A Risk-Aversion Approach for the Multiobjective Stochastic Programming Problem
(MDPI, 2020-11)
Multiobjective stochastic programming is a field that is well suited to tackling problems that arise in many fields: energy, financial, emergencies, among others; given that uncertainty and multiple objectives are usually ...
Artículo
![Con acceso al texto completo Icon](/themes/idUS//images/acceso/opened_access.png)
Robust optimal classification trees under noisy labels
(Springer, 2021-10-05)
In this paper we propose a novel methodology to construct Optimal Classification Trees that takes into account that noisy labels may occur in the training sample. The motivation of this new methodology is based on the ...