An Easy Way to Build Parallel State-of-the-art Combinatorial Optimization Problem Solvers: A Computational Study on Solving Steiner Tree Problems and Mixed Integer Semidefinite Programs by using ug[SCIP-,]-Libraries

Branch-and-bound (B&B) is an algorithmic framework for solving NP-hard combinatorial optimization problems. Although several well-designed software frameworks for parallel B&B have been developed over the last two decades, there is very few literature about successfully solving previously in...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) S. 530 - 541
Hauptverfasser:	Shinano, Yuji, Rehfeldt, Daniel, Gally, Tristan
Format:	Tagungsbericht
Sprache:	Englisch Japanisch
Veröffentlicht:	IEEE 01.05.2019
Schlagworte:	Libraries mixed integer semidefinite programming Optimization parallel branch-and-bound Program processors SCIP Software algorithms Steiner tree problem Steiner trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!