Network design problems deal with the selection of a subset of edges in an existing network, such that for a set of commodities the given demand for each commodity can be transported from its origin to its destination, at minumum cost. In the capacitated network design problem the edges have (fixed) capacities. Network design problems arise in telecommunications and transportation planning.
The data of the instances are read using XML files.
Benders Decomposition, GMP, XML.
Raack, C., A.M.C.A. Koster, S. Orlowski, R. Wessaly, On cut-based inequalities for capacitated network design polyhedra, Networks 57(2) (2011), pp. 141-156.
A zip file with this example can be downloaded here.