The Ubiquity Generator Framework: 7 Years of Progress in Parallelizing Branch-and-Bound
From MaRDI portal
Publication:4685750
DOI10.1007/978-3-319-89920-6_20zbMath1397.90405OpenAlexW2781777076MaRDI QIDQ4685750
Publication date: 9 October 2018
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_20
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05)
Related Items
Development and analysis of massive parallelization of a lattice basis reduction algorithm, UG, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, Linearization and parallelization schemes for convex mixed-integer nonlinear optimization
Uses Software
Cites Work
- Unnamed Item
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- A First Implementation of ParaXpress: Combining Internal and External Parallelization to Solve MIPs on Supercomputers
- A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling
- FiberSCIP—A Shared Memory Parallelization of SCIP