Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)
  • search hit 8 of 224
Back to Result List

UG - Ubiquity Generator Framework v0.9.1

  • UG is a generic framework to parallelize branch-and-bound based solvers (e.g., MIP, MINLP, ExactIP) in a distributed or shared memory computing environment. It exploits the powerful performance of state-of-the-art "base solvers", such as SCIP, CPLEX, etc. without the need for base solver parallelization. UG framework, ParaSCIP(ug[SCIP,MPI]) and FiberSCIP (ug[SCIP,Pthreads]) are available as a beta version. For MIP solving, ParaSCIP and FiberSCIP are well debugged and should be stable. For MINLP solving, they are relatively stable, but not as thoroughly debugged. This release version should handle branch-and-cut approaches where subproblems are defined by variable bounds and also by constrains for ug[SCIP,*] ParaSCIP and FiberSCIP). Therefore, problem classes other than MIP or MINLP can be handled, but they have not been tested yet. v0.9.1: Update orbitope cip files.

Download full text files

Export metadata

Metadaten
Author:Yuji ShinanoORCiD
Document Type:Software
Tag:branch-and-bound parallelization; integer optimization; parallelization framework
MSC-Classification:65-XX NUMERICAL ANALYSIS
68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area)
Publishing Institution:Zuse Institute Berlin (ZIB)
Date of first Publication:2020/12/19
Overview version of software:UG
Version Number:v0.9.1
Related Identifier:https://doi.org/10.1007/978-3-319-89920-6_20
Related Identifier:https://doi.org/10.1007/978-3-642-24025-6_12
Filesize:3.8 MB
swMATH-ID:https://swmath.org/software/3500
Type of software:Parallelization framework for Branch-and-Bound-Solvers
Software Licence:https://www.scipopt.org/academic.txt
Project homepage:https://ug.zib.de/
Funding institution:DFG
Grant ID:391087700
DOI:https://doi.org/10.12752/8508
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.