Titre : Is MmC polynomial for LP?

Résumé :
The minimum mean cycle algorithm (MmC) is known to be strongly polynomial for the capacitated network flow problem with $O(m^2n)$ iterations, where $m$ is the number of arc variables and $n$ is the number of node constraints. In this talk, we examine some properties of MwC, the textit{weighted mean} version of MmC adapted to Linear Programming. In particular, we show that IPS, the Improved Primal Simplex algorithm, is an approximation of MwC.

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