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...

in 2d soccer simulation league, agents will decide based on information and data in their model. effective decisions need to have world model information without any noise and missing data; however, there are few solutions to omit noise in world model data; so we should find efficient ways to reduce the effect of noise when making decisions. in this article we evaluate some simple solutions whe...

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...

Recent years have witnessed tremendous developments regarding wireless network access. In this paper emphasis is given to methods for the design of in-door Coded Division Multiple Access (CDMA) based wireless networks and Fixed Wireless (e.g. Wireless Local Loop WLL) networks, which are referred to as wireless access networks. In these networks, two main types of network components are consider...

We describe the most efficient solutions to the word problem of Artin’s braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially suitable for cryptographical applications. Most results appear in literature; however, some results about the greedy normal form and the symmetric normal form an...

This paper presents new algorithms for solving some geometric problems on a shared memory parallel computer j where concurrent reads are allowed but no two processors can simultaneously attempt to write in the same memory location. The algorithms are quite different from known sequential algorithms, and are based on the use of a new parallel divide-and-conquer technique. One of our results is a...

We prove polynomial-time solvability of a large class of clustering problems where a weighted set of items has to be partitioned into clusters with respect to some balancing constraints. The data points are weighted with respect to different features and the clusters adhere to given lower and upper bounds on the total weight of their points with respect to each of these features. Further the we...