A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source maximum concurrent flow - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès INOC '13 : International Network Optimization Conference Année : 2013

A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source maximum concurrent flow

Résumé

In this paper, a new decomposition approach is proposed to solve large size instances of Multicommodity Flow problems. Instead of generating paths, we generate trees in a convenient way. Numerical results show that the new approach is much more efficient than the classical paths generation approach. Moreover, we propose a combinatorial polynomial-time algorithm to solve the maximum concurrent flow problem (MCF) in the single-source case.

Dates et versions

hal-00838566 , version 1 (26-06-2013)

Identifiants

Citer

Pierre-Olivier Bauguion, Walid Ben-Ameur, Eric Gourdin. A new model for multicommodity flow problems, and a strongly polynomial algorithm for single-source maximum concurrent flow. INOC '13 : International Network Optimization Conference, May 2013, Tenerife, Spain. pp.311-318, ⟨10.1016/j.endm.2013.05.107⟩. ⟨hal-00838566⟩
59 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More