Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM

F. Babonneau (), O. du Merle () and J.-P. Vial ()
Additional contact information
F. Babonneau: Logilab, HEC, Université de Genève, 40 Bd du Pont d’Arve, CH-1211 Geneva, Switzerland
O. du Merle: Air France, Operations Research Department, 1 Avenue du Maréchal Devaux, 91550 Paray-Vieille-Poste, France
J.-P. Vial: Logilab, HEC, Universitè de Genéve, 40 Bd du Pont d’Arve, CH-1211 Geneva, Switzerland

Operations Research, 2006, vol. 54, issue 1, 184-197

Abstract: In this paper, we propose to solve the linear multicommodity flow problem using a partial Lagrangian relaxation. The relaxation is restricted to the set of arcs that are likely to be saturated at the optimum. This set is itself approximated by an active set strategy. The partial Lagrangian dual is solved with Proximal-ACCPM, a variant of the analytic center cutting-plane method. The new approach makes it possible to solve huge problems when few arcs are saturated at the optimum, as appears to be the case in many practical problems.

Keywords: network; linear multicommodity flow; analytic center cutting-plane method; active set strategy (search for similar items in EconPapers)
Date: 2006
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1050.0262 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:54:y:2006:i:1:p:184-197

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().