Datum / čas
Date(s) - 18.02.
15:00 - 16:00
Kategorie
We invite you to the next seminar in the Scheduling Seminars series, this time featuring a talk by Christian Blum entitled: CMSA: A Hybrid Metaheuristic for Combinatorial Optimization.
IIIA-CSIC
WHEN: Feb 18, 15:00 Wed
Invited by: Zdeněk Hanzálek (CTU in Prague)
Abstract:
Construct, Merge, Solve & Adapt (CMSA) is an award-winning, hybrid algorithm for solving hard combinatorial optimization problems. The main idea consists in the iterated application of an exact solver—such as an integer linear programming (ILP) solver—to sub-instances of the original problem instance. These sub-instances are enlarged at each iteration by adding solution components from a set of valid solutions that are obtained either by probabilistic solution construction or by any other means. Moreover, seemingly useless (or even harmful) solution components are removed. In this talk, an introduction to CMSA will be given, in addition to describing some of the most recent research lines around this technique.