supplier selection is a multi-criteria problem. this study proposes a hybrid model for supporting the suppliers’ selection and ranking. this research is a two-stage model designed to fully rank the suppliers where each supplier has multiple inputs and outputs. first, the supplier evaluation problem is formulated by data envelopment analysis (dea), since the regarded decision deals with uncertai...

The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in machine learning. We study generalization properties of ranking algorithms, in a particular setting of the ranking problem known as the bipartite ranking problem, using the notion of algorithmic stability. In particular,...

This paper addresses the problem of rank aggregation, which aims to find a consensus ranking among multiple ranking inputs. Traditional rank aggregation methods are deterministic, and can be categorized into explicit and implicit methods depending on whether rank information is explicitly or implicitly utilized. Surprisingly, experimental results on real data sets show that explicit rank aggreg...

In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem of vertex ranking of weighted trees to the vertex ranking of (simple) chordal graphs, which proves that the latter problem is NP-hard. In this way we solve an open problem of Aspvall and Heggernes. We use this reduction ...

T problem of group ranking, also known as rank aggregation, has been studied in contexts varying from sports, to multicriteria decision making, to machine learning, to ranking Web pages, and to behavioral issues. The dynamics of the group aggregation of individual decisions has been a subject of central importance in decision theory. We present here a new paradigm using an optimization framewor...

For the seventh time, I rank universities according to their contributions to the INFORMS practice literature and trace the evolution of the rankings of the top universities. Two universities are tied for the top ranking this time: the Georgia Institute of Technology and the University of Pennsylvania. Erasmus University, the University of British Columbia, and the University of Chile are now t...

Abstract In this paper we have investigated a fuzzy linear programming problem with fuzzy quantities which are LR triangular fuzzy numbers. The given linear programming problem is rearranged according to the satisfactory level of constraints using breaking point method. By considering the constraints, the arranged problem has been investigated for all optimal solutions connected with satisf...

The minimum vertex ranking spanning tree problem is to find a spanning tree of G whose vertex ranking is minimum. This problem is NP-hard and no polynomial time algorithm for solving it is known for non-trivial classes of graphs other than the class of interval graphs. This paper proposes a polynomial time algorithm for solving the minimum vertex ranking spanning tree problem on outerplanar gra...