Mrad, M.Haouari, Mohamed2012-05-312012-05-312008-10-150096-3003http://hdl.handle.net/10679/190https://doi.org/10.1016/j.amc.2008.07.031Due to copyright restrictions, the access to the full text of this article is only available via subscription.We investigate a multicommodity network design problem where a discrete set of Technologies with step-increasing cost and capacity functions should be installed on the edges. This problem is a fundamental network design problem having many important applications in contemporary telecommunication networks. We describe an exact constraint generation approach and we show that the conjunctive use of valid inequalities, bipartition inequalities that are generated using max-flow computations, as well as an exact separation algorithm of metric inequalities makes it feasible to solve to optimality instances with up to 50 nodes and 100 edges.engrestrictedAccessarticle204274575300026001700002610.1016/j.amc.2008.07.031Network designSynthesis of capacitated networksMulticommodity flowsConstraint generation2-s2.0-53449089291