Buscar
Mostrando ítems 1-10 de 15
Artículo
A semidefinite programming approach for solving multiobjective linear programming
(Springer, 2014-03)
Several algorithms are available in the literature for finding the entire set of Pareto-optimal solutions in MultiObjective Linear Programming (MOLP). However, it has not been proposed so far an interior point algorithm ...
Artículo
New models for the location of controversial facilities: A bilevel programming approach
(Elsevier, 2019-07)
Motivated by recent real-life applications in Location Theory in which the location decisions generate controversy, we propose a novel bilevel location model in which, on the one hand, there is a leader that chooses among ...
Artículo
Rank aggregation in cyclic sequences
(Springer, 2016-05-10)
In this paper we propose the problem of finding the cyclic sequence which best represents a set of cyclic sequences. Given a set of elements and a precedence cost matrix we look for the cyclic sequence of the elements which ...
Artículo
A market regulation bilevel problem: a case study of the Mexican petrochemical industry
(Elsevier, 2019-08)
In this paper, a bilevel programming model is proposed to study a problem of market regulation through government intervention. One of the main characteristics of the problem herein analyzed is that the government ...
Artículo
Unreliable point facility location problems on networks
(Elsevier, 2014-03)
In this paper we study facility location problems on graphs under the most common criteria, such as, median, center and centdian, but we incorporate in the objective function some reliability aspects. Assuming that facilities ...
Tesis Doctoral
The discrete ordered median problem revisited: new formulations, propeties and algorithms
(2016-07-18)
Este trabajo estudia en profundidad la estructura del problema disctreto de la mediana ordenada (DOMP, por su acrónimo en inglés) con el objetivo de deñir nuevas formulaciones y algoritmos de resolución. Además, analizamos ...
Artículo
Mixed integer linear programming and heuristic methods for feature selection in clustering
(Taylor & Francis, 2018)
This paper studies the problem of selecting relevant features in clustering problems, out of a data set in which many features are useless, or masking. The data set comprises a set U of units, a set V of features, a set R ...
Artículo
Mathematical programming formulations for the efficient solution of the k-sum approval voting problem
(Elsevier, 2018-10)
In this paper we address the problem of electing a committee among a set of m candidates and on the basis of the preferences of a set of n voters. We consider the approval voting method in which each voter can approve as ...
Artículo
Finding the nucleolus of any n-person cooperative game by a single linear program
(Elsevier, 2013-10)
In this paper we show a new method for calculating the nucleolus by solving a unique minimization linear program with O(4n) constraints whose coeffi- cients belong to {−1, 0, 1}. We discuss the need of having all these ...