A MULTI-KP MODELING FOR THE MAXIMUM-CLIQUE PROBLEM

Authors
DELLACROCE F TADEI R
Citation
F. Dellacroce et R. Tadei, A MULTI-KP MODELING FOR THE MAXIMUM-CLIQUE PROBLEM, European journal of operational research, 73(3), 1994, pp. 555-561
Citations number
14
Categorie Soggetti
Management,"Operatione Research & Management Science
Journal title
European journal of operational research → ACNP
ISSN journal
03772217
Volume
73
Issue
3
Year of publication
1994
Pages
555 - 561
Database
ISI
SICI code
0377-2217(1994)73:3<555:AMMFTM>2.0.ZU;2-4
Abstract
In this paper the problem of finding the maximum clique of an arbitrar y graph G = (X, A) is studied. This problem is formulated as a 0-1 mul tidimensional knapsack problem and a greedy algorithm for solving it i s presented. Finally a branch and bound method based on the 0-1 multi- KP model and some computational results are given.