We introduce a fully online model of maximum cardinality matching in which all vertices arrive online. On the arrival of a vertex, its incident edges to previously-arrived vertices are revealed. Each vertex has a deadline that is after all its neighbors’ arrivals. If a vertex remains unmatched until its deadline, the algorithm must then irrevocably either match it to an unmatched neighbor, or l...

generally, an engineering design problem has multiple objective functions. some of these problems can be formulated as multiobjective geometric programming models. on the other hand,often in the real world, coefficients of the objective functions are not known precisely. coefficients may be interpreted as fuzzy numbers, which lead to a multiobjective geometric programming with fuzzy parameters....

this paper uses integrated data envelopment analysis (dea) models to rank all extreme and non-extreme efficient decision making units (dmus) and then applies integrated dea ranking method as a criterion to modify genetic algorithm (ga) for finding pareto optimal solutions of a multi objective programming (mop) problem. the researchers have used ranking method as a shortcut way to modify ga to d...

Due to its numerous applications, rank aggregation has become a problem of major interest across many fields of the computer science literature. In the vast majority of situations, Kemeny consensus(es) are considered as the ideal solutions. It is however well known that their computation is NP-hard. Many contributions have thus established various results to apprehend this complexity. In this p...

The paper presents a methodology for calculating the aggregate global university ranking (Aggregated Global University Ranking, or AGUR), which consists of an automated presentation of the comparable lists of names for different universities from particular global university rankings (using Machine Learning and Mining Data algorithms) and a simple procedure of aggregating particular global univ...

Data envelopment analysis (DEA) is a mathematical programming method for calculatingefficiency of decision making units (DMU). In calculating the efficiency score of unitsthrough DEA we may come up with some efficient units. But the question is among theseefficient units which of them is better. As we know, it is possible to rank inefficient unitsthrough efficiency score; however, for ranking e...