BOB
From MaRDI portal
Cited in
(12)- Parallel processing for difficult combinatorial optimization problems
- SBmethod
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- ParaXpress
- BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
- EIQP IIQP
- MIQCR-CB
- PPBB
- Computational results of a semidefinite branch-and-bound algorithm for k-cluster
- The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound
- QUBO software
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
This page was built for software: BOB
