This website uses third party cookies to improve your experience. If you continue browsing or close this notice, you will accept their use.

Effective decomposition techniques for hard combinatorial optimization problems

29 January 2021 at 11:00 AM - 12:00 PM

Room Luiss Research Seminars, Campus on Luiss

Speaker: Fabio Furini, Italian National Research Council CNR

Divide and conquer, from Latin divide et impera, is one of the key techniques for tackling combinatorial optimization problems. It relies on the idea of decomposing complex problems into a sequence of subproblems that are then easier to handle. Decomposition techniques (such as Dantzig-Wolfe, Lagrangian, or Benders decomposition) are extremely effective in a wide range of applications, including cutting & packing, production & scheduling, routing & logistics, telecommunications, transportation and many others. Moreover, decomposition techniques are playing an important role in many different fields of mixed-integer linear and non-linear optimization, multi objective optimization, optimization under uncertainty, bilevel optimization, etc. Despite the tremendous amount of research on these topics, the mathematical optimization community is constantly faced with new challenges coming from theoretical aspects and real world applications that require the development of new advanced tools. In this talk, I will present state-of-the-art decomposition techniques for several combinatorial  optimization problems with a particular attention in covering, location, coloring and general mixed integer linear programs.