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...

Celý popis

Podrobná bibliografie

Vydáno v:	2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) s. 530 - 541
Hlavní autoři:	Shinano, Yuji, Rehfeldt, Daniel, Gally, Tristan
Médium:	Konferenční příspěvek
Jazyk:	angličtina japonština
Vydáno:	IEEE 01.05.2019
Témata:	Libraries mixed integer semidefinite programming Optimization parallel branch-and-bound Program processors SCIP Software algorithms Steiner tree problem Steiner trees
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!