A multi-KP modeling for the maximum-clique problem

0.00 Avg rating—0 Votes

Article ID:	iaor19972102
Country:	Netherlands
Volume:	73
Issue:	3
Start Page Number:	555
End Page Number:	561
Publication Date:	Mar 1994
Journal:	European Journal of Operational Research
Authors:	Tadei Roberto, Croce Federico Della
Keywords:	programming: branch and bound

Abstract:

In this paper the problem of finding the maximum clique of an arbitrary graph G=(X,A) is studied. This problem is formulated as a 0-1 multidimensional knapsack problem and a greedy algorithm for solving it is presented. Finally a branch and bound method based on the 0-1 multi-KP model and some computational results are given.

Reviews

Required fields are marked *. Your email address will not be published.