BiqCrunch: A Semidefinite Branch-and-Bound Method for Solving Binary Quadratic Problems.
Nathan KrislockJérôme MalickFrédéric RoupinPublished in: ACM Trans. Math. Softw. (2017)
Keyphrases
- semidefinite
- semidefinite programming
- branch and bound method
- solving problems
- convex relaxation
- combinatorial optimization
- interior point methods
- branch and bound
- higher dimensional
- sufficient conditions
- optimization problems
- mixed integer programming
- computational complexity
- branch and bound algorithm
- globally optimal
- search algorithm
- reduce the search space
- pairwise