A parallel branch and bound algorithm for the maximum labelled clique problem
نویسندگان
چکیده
منابع مشابه
A Parallel Branch and Bound Algorithm for the Maximum Labelled Clique Problem
The maximum labelled clique problem is a variant of the maximum clique problemwhere edges in the graph are given labels, and we are not allowed to use more than a certain number of distinct labels in a solution. We introduce a new branch-andbound algorithm for the problem, and explain how it may be parallelised. We evaluate an implementation on a set of benchmark instances, and show that it is ...
متن کاملA branch and bound algorithm for the maximum clique problem
A method to solve the maximum clique problem based on an unconstmin~ quadratic zero-one programming fo~ulation is presented. A branch and bound algorithm for unconstrained quadratic zero-one programming is given that uses a technique to dynamically select variables for the ordering of the branching tree. Dynamic variable selection is equivalent to vertex selection in a similar branch and bound ...
متن کاملReducing the Branching in a Branch and Bound Algorithm for the Maximum Clique Problem
Finding the largest clique in a given graph is one of the fundamental NP-hard problems. We take a widely used branch and bound algorithm for the maximum clique problem, and discuss an alternative way of understanding the algorithm which closely resembles a constraint model. By using this view, and by taking measurements inside search, we provide a new explanation for the success of the algorith...
متن کاملAn Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem
State-of-the-art branch-and-bound algorithms for the maximum clique problem (Maxclique) frequently use an upper bound based on a partition P of a graph into independent sets for a maximum clique of the graph, which cannot be very tight for imperfect graphs. In this paper we propose a new encoding from Maxclique into MaxSAT and use MaxSAT technology to improve the upper bound based on the partit...
متن کاملA branch and bound algorithm for the maximum diversity problem
This article begins with a review of previously proposed integer formulations for the maximum diversity problem (MDP). This problem consists of selecting a subset of elements from a larger set in such a way that the sum of the distances between the chosen elements is maximized. We propose a branch and bound algorithm and develop several upper bounds on the objective function values of partial s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2014
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-014-0837-4