BiqBin
swMATH ID: | 36019 |
Software Authors: | Hrga, Timotej; Lužar, Borut; Povh, Janez; Wiegele, Angelika |
Description: | 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. This algorithm is available as a part of the online BiqBin solver, which enables online submissions of problem instances. After submission, it automatically generates computational jobs and runs them using the high-performance computer available at University of Ljubljana. BiqBin demonstrates how to bring HPC closer to specific user community – in our case the mathematical optimization community. |
Homepage: | http://www.biqbin.eu |
Keywords: | high-performance computing; stable set problem; online solver; mathematical optimization |
Related Software: | BiqCrunch; BiqMac; QPLIB; MADAM; Biq Mac; SCIP; Gurobi; CPLEX; MQLib; CirCut; ParaSCIP; McSparse; ISLR; Rudy; MIPLIB; MKL |
Cited in: | 3 Documents |
Standard Articles
all
top 5
Cited by 9 Authors
2 | Hrga, Timotej |
2 | Lužar, Borut |
2 | Povh, Janez |
2 | Wiegele, Angelika |
1 | Gusmeroli, Nicoló |
1 | Koch, Thorsten |
1 | Rehfeldt, Daniel |
1 | Shinano, Yuji |
1 | Siebenhofer, Melanie |
Cited in 2 Serials
1 | ACM Transactions on Mathematical Software |
1 | Mathematical Programming Computation |
Cited in 3 Fields
2 | Numerical analysis (65-XX) |
2 | Operations research, mathematical programming (90-XX) |
1 | Computer science (68-XX) |