engleski

On Network Design: Cost Minimization via Amalgamation of Flows

We discuss a network design problem where every two nodes can communicate directly. However, there is an incentive to combine flow from different sources. Namely, if the total flow on a link is bigger than the prescribed threshold, the cost of this flow is discounted by a factor alpha. We present three alternative mixed integer linear formulations for this problem. Computational results comparing the three models on a set of benchmark problems and using CPLEX software are presented.

network design ; branch and bound ; CPLEX ; mixed integer programming

nije evidentirano