HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Interior Point Methods With Decomposition For Multicommodity Flow Problems

Abstract : This paper introduces an approach by decomposition of an interior point method for solving multicommodity flow problems. First, we present this approach in the general framework of coupling constraints problems. Next, we propose to specialize the algorithm to the linear multicommodity network-fl- ow problems. We expose this specialization using the node-arc formulation. Then, we focus on the arc-path formulation and we propose decomposition method witch incorporates the interior point method into the Dantzig-Wolfe decomposition technique. The numerical results show the superiority of this last formulation. Finally, we report some numerical results obtained by testing these algorithms with data from the France-Telecom Paris district transmission network.
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:59:18 AM
Last modification on : Friday, February 4, 2022 - 3:19:08 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:23:13 PM


  • HAL Id : inria-00072804, version 1



J. Frederic Bonnans, Mounir Haddou, Abdel Lisser, Raja Rébaï. Interior Point Methods With Decomposition For Multicommodity Flow Problems. [Research Report] RR-3852, INRIA. 2000. ⟨inria-00072804⟩



Record views


Files downloads