BOB: A unified platform for implementing branch-and-bound like algorithms. In this report, we propose the library BOB for an easy development of the Branch-and-Bound applications (min/maximization). This library has the double goal of allowing on the one hand the Combinatorial Optimization community to implement their applications without worrying about the architecture of the machines and benefiting the advantages provided by parallelism. On the other hand, BOB offers to the community of Parallelism a set of benchmark composed by the efficient algorithms of Combinatorial Optimization for its parallelization methods and/or tools. ..
Keywords for this software
References in zbMATH (referenced in 6 articles )
Showing results 1 to 6 of 6.
- Shinano, Yuji: The ubiquity generator framework: 7 years of progress in parallelizing branch-and-bound (2018)
- Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation (2017)
- Krislock, Nathan; Malick, Jérôme; Roupin, Frédéric: BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems (2017)
- Krislock, Nathan; Malick, Jérôme; Roupin, Frédéric: Computational results of a semidefinite branch-and-bound algorithm for (k)-cluster (2016)
- Krislock, Nathan; Malick, Jérôme; Roupin, Frédéric: Improved semidefinite bounding procedure for solving max-cut problems to optimality (2014)
- Roucairol, Catherine: Parallel processing for difficult combinatorial optimization problems (1996)