Simple and Fast: Improving a Branch-And-Bound Algorithm for Maximum Clique.
Torsten FahlePublished in: ESA (2002)
Keyphrases
- branch and bound algorithm
- maximum clique
- lower bound
- branch and bound
- optimal solution
- np hard
- upper bound
- upper bounding
- single machine scheduling problem
- combinatorial optimization
- precedence constraints
- variable ordering
- association graph
- search space
- objective function
- neural network
- computational biology
- first order logic