REFORMULATIONS AND DECOMPOSITIONS OF MIXED INTEGER LINEAR PROGRAMS

A course by Prof. Fabio Furini (Université Paris Dauphine)

  • Date:

    27 MAY
    -
    31 MAY 2019
     from 14:30 to 17:00
  • Event location: DEI Bologna - Viale Risorgimento, 2 - Aula 2.7A - Aula 5.6

  • Type: Course

Agenda

 

1. May 27, 2019 h. 14.30 - 17.00

    Aula 2.7A, School of Engineering, Bologna

2. May 31, 2019 h. 14.30 - 17.00

    Aula 5.6, School of Engineering, Bologna


Abstract

 

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.

Contacts

Enrico Malaguti

Write an e-mail