We propose a novel approach for data clustering based on sequential multi-objective multi-act games (ClusSMOG). It automatically determines the number of clusters and optimises simultaneously the inertia and the connectivi-ty objectives. The approach consists of three structured steps. The first step identifies initial clusters and calculates a set of… (More)
In this paper we propose an algorithm for solving bilevel linear programming problems, in which the second level problem is replaced by its Karush-Kuhn-Tucker optimality conditions. This algorithm is a combination of the DCA algorithm in DC programming and the exact penalty methods.
This paper deals to solve the one dimensional bin-packing problem with conflicts. The conflicts are represented by a graph whose nodes are the items, and adjacent items cannot be packed into the same bin. We propose an adaptation of Minimum Bin Slack heuristic also with a combination of heuristics based on the uses of the classical bin-packing methods to… (More)
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized convex functions by combining the concepts of weak strictly pseudoinvex, strong pseudoinvex, weak quasi invex, weak pseudoinvex and strong quasi invex functions in Aghezzaf and Hachimi [Numer.… (More)
In this paper, the well-known forwarder's dilemma is generalized by accounting for the presence of link quality fluctuations; the forwarder's dilemma is a four-node interaction model with two source nodes and two destination nodes. It is known to be very useful to study ad hoc networks. To characterize the long-term utility region when the source nodes have… (More)