BiqBin: Moving Boundaries for NP-hard Problems by HPC

In this paper we present a parallel Branch and Bound (B&B) algorithm to solve the Stable Set Problem, which is a well-known combinatorial optimization problem. The algorithm is based on tight semidefinite programming bounds. Numerical results, based on using up to 192 CPU cores, show that this algorithm scales well.

[1]  Jean B. Lasserre.  A MAX-CUT formulation of 0/1 programs , 2016, Oper. Res. Lett..

[2]  Daniela M. Witten,et al.  An Introduction to Statistical Learning: with Applications in R , 2013 .

[3]  Franz Rendl,et al.  Copositive and semidefinite relaxations of the quadratic assignment problem , 2009, Discret. Optim..

[4]  Franz Rendl,et al.  Regularization Methods for Semidefinite Programming , 2009, SIAM J. Optim..

[5]  J. Povh.  Contribution of copositive formulations to the graph partitioning problem , 2013 .

[6]  M. Trick,et al.  Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993 , 1996 .

[7]  Janez Povh,et al.  Semidefinite approximations for quadratic programs over orthogonal matrices , 2010, J. Glob. Optim..

[8]  Rui Xu,et al.  Survey of clustering algorithms , 2005, IEEE Transactions on Neural Networks.

[9]  Franz Rendl,et al.  Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations , 2009, Math. Program..

[10]  J. Lasserre,et al.  Handbook on Semidefinite, Conic and Polynomial Optimization , 2012 .

[11]  Conrad Sanderson,et al.  Armadillo: a template-based C++ library for linear algebra , 2016, J. Open Source Softw..

[12]  Trevor Hastie,et al.  An Introduction to Statistical Learning , 2013, Springer Texts in Statistics.

[13]  Xin-She Yang.  Introduction to Mathematical Optimization: From Linear Programming to Metaheuristics , 2008 .

[14]  Franz Rendl,et al.  A Boundary Point Method to Solve Semidefinite Programs , 2006, Computing.

[15]  David S. Johnson,et al.  Cliques, Coloring, and Satisfiability , 1996 .