Titre : IPS and Capacitated minimum cost flow problems

Résumé :
The minimum mean cycle (MmC) algorithm belongs to the prized strongly polynomial family of algorithm. The latter has been developed to solve capacitated network problems. We review the theory behind this algorithm in order to make a parallel study with IPS when it is applied to the same kind of problems. The purpose of this talk is threefold: establish theoretical properties for IPS-MMC algorithm, provide some insights about the behavior of this algorithm and develop some acceleration techniques.

Nous vous remercions de confirmer votre présence.
http://www.doodle.com/p5hdz2mf8738rf5f