A multi-KP modeling for the maximum-clique problem
- 1 March 1994
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 73 (3) , 555-561
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990
- Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graphComputers & Operations Research, 1990
- Note—An Approximate Algorithm for Multidimensional Zero-One Knapsack Problems—A Parametric ApproachManagement Science, 1988
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- Determining the number of internal stability of a graphInternational Journal of Computer Mathematics, 1982
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack ProblemOperations Research, 1979
- Clique detection for nondirected graphs: Two new algorithmsComputing, 1979
- A node covering algorithmNaval Research Logistics Quarterly, 1977
- Vertex packings: Structural properties and algorithmsMathematical Programming, 1975
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973