MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS

ABSTRACT We present a survey on nonconvex models and algorithms for multicommodity network design problems. We put in perspective the alternative modelling of these problems, traditionally represented by mixed-integer linear programs, by separable nonconvex arc cost functions. We show in particular that some problems take profit of a continuous modelling and explore the case of capacity expansion of communications networks.