The maximum clique problem (MCP) is to determine in a graph a clique (ie, a complete
subgraph) of maximum cardinality. The MCP is notable for its capability of modeling other …

Abstract The Maximum Weight Clique problem (MWCP) is an important generalization of the
Maximum Clique problem with wide applications. This paper introduces two heuristics and …

The maximum weight clique problem (MWCP) is an important generalization of the
maximum clique problem with wide applications. In this study, we develop two efficient local …

The maximum clique problem (MCP) is one of the most popular combinatorial optimization
problems with various practical applications. An important generalization of MCP is the …

This paper explores techniques for fast solving the maximum weight clique problem (MWCP)
in very large scale real-world graphs. Because of the size of such graphs and the …

Starting from an algorithm recently proposed by Pullan and Hoos, we formulate and analyze
iterated local search algorithms for the maximum clique problem. The basic components of …

Given an undirected graph G=(V, E) with vertex set V={1,…, n} and edge set E⊆ V× V. The
maximum clique problem is to determine in G a clique (ie, a complete subgraph) of …

Educational assessments occasionally require uniform test forms for which each test form
comprises a different set of items, but the forms meet equivalent test specifications (ie …

In this paper we present improvements to one of the most recent and fastest branch-and-
bound algorithm for the maximum clique problem—MCS algorithm by Tomita et …

In this paper we consider two branch and bound algorithms for the maximum clique problem
which demonstrate the best performance on DIMACS instances among the existing …