The convex hull of two core capacitated network design problems
Mathematical Programming: Series A and B
Network Design Using Cut Inequalities
SIAM Journal on Optimization
Solving the Two-Connected Network with Bounded Meshes Problem
Operations Research
IEICE - Transactions on Information and Systems
0-1 reformulations of the multicommodity capacitated network design problem
Discrete Applied Mathematics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
This paper studies a topical capacitated network design problem that arises in the telecommunication industry. In this problem, given point-to-point demand between various pairs of nodes, a minimum cost survivable network must be designed by installing equipments (routers, line cards, ...) on nodes as well as link facilities on arcs. This realistic problem finds its motivation in the rapidly developing field of telecommunication networks and the introduction of fiber-optic technology. It is, in particular, faced by the network designer whenever a new network is set up. To the best of our knowledge, this is the first work that addresses this capacitated network design problem where equipments, such as routers and lines cards, have to be settled on network nodes. We present in this paper a comprehensive model to our network design problem. One exact algorithm and two heuristic approaches are proposed to solve this problem. Numerical results are provided for randomly generated networks and networks coming from real-word applications.