Density-based cluster mining is known to serve a broad range of applications ranging from stock trade analysis to moving object monitoring. Although methods for efficient extraction of density-based clusters have been studied in the literature, the problem of summarizing and matching of such clusters with arbitrary shapes and complex cluster structures remains unsolved. Therefore, the goal of o...

in recent years wireless sensor networks have attracted researchers' attention due to vast applications. one of the most prominent issues regarding these networks is coverage which is considered as a quality of service parameter. in this study, we try to address energy shortage in wsns through finding a set of optimal coverage nodes in a specific environment. this is performed utilizing effecti...

A direct way of reducing the number cars on road is to dissuade individuals from exclusively using their car and instead integrate public transport into daily routine. Planning multi-modal journeys a complex task for which often rely decision support tools. However, offering different journey options represents significant algorithmic challenge. The failure provide users with set that differ co...

  We suggest a method for finding the non-dominated points of the production possibility set (PPS) with variable returns to scale (VRS) technology in data envelopment analysis (DEA). We present a multiobjective linear programming (MOLP) problem whose feasible region is the same as the PPS under variable returns to scale for generating non-dominated points. We demonstrate that Pareto solutions o...

The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality has been presented in this current paper. Such type of facets plays an important role in set covering set partitioning, matroidal-intersection vertex- packing, generalized assignment and other combinatorial problems. Strong covers for facets of Knapsack ploytope has been developed in the first pa...