Calendrier

Séminaire sur la réduction dynamiques des contraintes - Jacques Desrosiers.

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

Date

Wednesday December 12, 2012
Starts at 12:00

Price

Gratuit

Contact

514 340-6053, poste 6991

Place

Université de Montréal - Pavillon André-Aisenstadt
2920, chemin de la Tour
Montréal
QC
Canada
H3T 1N8
514 343-6111
4488

Categories