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.
Technical report, Ordecsys, November 2007.
View A partitioning algorithm for the network loading problem