Speeding up branch and bound algorithms for solving the maximum clique problem.
Evgeny MaslovMikhail BatsynPanos M. PardalosPublished in: J. Glob. Optim. (2014)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- finding an optimal solution
- branch and bound
- lower bound
- variable ordering
- upper bound
- randomly generated
- optimal solution
- set covering problem
- np hard
- maximum clique
- search tree
- simulated annealing
- max sat
- search algorithm
- combinatorial problems
- traveling salesman problem
- metaheuristic
- optimization problems
- scheduling problem
- cost function
- knowledge base
- approximation algorithms
- neural network
- tabu search
- stochastic local search
- boolean satisfiability
- exact methods
- genetic algorithm