this paper uses the l1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (wdsnd) vectorsof a multi-objective mixed integer linear programming (momilp) problem.the proposed method generalizes the proposed approach by tohidi and razavyan[tohidi g., s. razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

This paper uses the L1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (WDSND) vectorsof a multi-objective mixed integer linear programming (MOMILP) problem.The proposed method generalizes the proposed approach by Tohidi and Razavyan[Tohidi G., S. Razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

this paper uses the weighted l$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. when all variables are integer it finds the whole set of efficient solutions. in each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

This paper uses the weighted L$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. When all variables are integer it finds the whole set of efficient solutions. In each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

multi-objective optimization is the simultaneous consideration of two or more objective functions that are completely or partially inconflict with each other. the optimality of such optimizations is largely defined through the pareto optimality. multiple objective integer linear programs (moilp) are special cases of multiple criteria decision making problems. numerous algorithms have been desig...

let g be a group. a subset x of g is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in x. if |x| ≥ |y | for any other set of pairwise non-commuting elements y in g, then x is said to be a maximal subset of pairwise non-commuting elements. in this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in X. If |X| ≥ |Y | for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...

2. We recall the two following concepts: 2.1. An infinite subset S of V(G) is concentrated if there is a ray R such that, for any finite set F of vertices, only finitely many elements of S do not belong to the component of G-F containing a subray of R. 2.2. A set of vertices of G is dkpersed in G if it has no concentrated subset. Note that any subset of vertices of a tree T which is dispersed i...

Frugivores are highly variable in their contribution to fruit removal in plant populations. However, data are lacking on species-specific variation in two central aspects of seed dispersal, distance of dispersal and probability of dispersal among populations through long-distance transport. We used DNA-based genotyping techniques on Prunus mahaleb seeds dispersed by birds (small- and medium-siz...