An Efficient approach for the Optimization version of Maximum Weighted Clique Problem
نویسنده
چکیده
Given a graph and a weight function defined on the vertex set of a graph, the maximum weighted clique (MWC) problem calls for finding the number of vertices with maximum total weight and also any two of vertices are pairwise adjacent. In this paper, an edge based local search algorithm, called ELS, is proposed for the MWC, a well-known combinatorial optimization problem. ELS is a two phased local search method effectively finds the near optimal solutions for theMWC. A parameter ‘support’ of vertices defined in the ELS greatly reduces the more number of random selections among vertices and also the number of iterations and running times. Computational results on DIMACS benchmark graphs indicate that ELS is capable of achieving state-of-the-art-performance for the maximum weighted clique with reasonable average running times. Key–Words: Maximum weighted clique, local search, heuristic, NP-complete.
منابع مشابه
A new family of facet defining inequalities for the maximum edge-weighted clique problem
This paper considers a family of cutting planes, recently developed for mixed 0-1 polynomial programs and shows that they define facets for the maximum edge-weighted clique problem. There exists a polynomial time exact separation algorithm for these inequalities. The result of this paper may contribute to the development of more efficient algorithms for the maximum edge-weighted clique problem ...
متن کاملA Multi-Objective Particle Swarm Optimization Algorithm for a Possibilistic Open Shop Problem to Minimize Weighted Mean Tardiness and Weighted Mean Completion Times
We consider an open shop scheduling problem. At first, a bi-objective possibilistic mixed-integer programming formulation is developed. The inherent uncertainty in processing times and due dates as fuzzy parameters, machine-dependent setup times and removal times are the special features of this model. The considered bi-objectives are to minimize the weighted mean tardiness and weighted mean co...
متن کاملOptimization Algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints
Many relevant problems can be described and successfully solved using graphbased models. For instance, the side-chain placement problem in biology, the choice of efficient communication protocols in management science, backbone design in telecommunication networks and data mining applications share a common structure: they all require to find a maximum weighted clique in a suitable graph [1]. W...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملAttributed Tree Matching and Maximum Weight Cliques
A classical way of matching relational structures consists of finding a maximum clique in a derived “association graph.” However, it is not clear how to apply this approach to problems where the graphs are hierarchically organized, i.e. are trees, since maximum cliques are not constrained to preserve the partial order. We have recently provided a solution to this problem by constructing the ass...
متن کامل