A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique with Computational Experiments.
Etsuji TomitaYoichi SutaniTakanori HigashiMitsuo WakatsukiPublished in: IEICE Trans. Inf. Syst. (2013)
Keyphrases
- maximum clique
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- np hard
- association graph
- combinatorial optimization
- precedence constraints
- lagrangian relaxation
- computational biology
- graph theory
- maximal cliques
- neural network
- single machine scheduling problem
- information retrieval
- mathematical programming
- multi objective
- traveling salesman problem
- vector space