HOẠT ĐỘNG TRONG TUẦN

Time: 10h30, Tuesday, March 26th, 2024

Venues: Room 617, building A6, Institute of Mathematics (18 Hoang Quoc Viet, Cau Giay, Hanoi)

Abstract: Many real-world problems can be solved as combinatorial optimization problems. First, we will briefly introduce the parallel branch-and-bound method, which is an algorithmic framework to find optimal solutions to combinatorial optimization problems. After that, the Ubiquity Generator (UG) framework, which was originally developed as a software framework to realize the parallel branch-and-bound method, is introduced. Currently, the UG framework can be used to parallelize any kind of algorithm implementation. In this talk, we will present several success stories for solving combinatorial optimization problems in parallel, including a real-world application for solving the supply chain service network design problem.