A partitioning algorithm for the network loading problem

Frédéric Babonneau (fbabonneaugmail.com)
Jean-Philippe Vial (jphvialmac.com)

Abstract: This paper proposes a Benders-like partitioning algorithm to solve the network loading problem. The effort of computing integer solutions is entirely left to a pure integer programming solver while valid inequalities are generated by solving standard nonlinear multicommodity flow problems. The method is compared to alternative approaches proposed in the literature and appears to be efficient.

Keywords: Network loading problem, Benders partitioning, ACCPM

Category 1: Network Optimization

Category 2: Integer Programming (Cutting Plane Approaches )

Citation: Technical report, Ordecsys, November 2007.

Download: [PDF]

Entry Submitted: 11/02/2007
Entry Accepted: 12/02/2007
Entry Last Modified: 02/17/2008

Modify/Update this entry