Routing Through Virtual Paths in Layered Telecommunication Networks
Operations Research
Routing, Flow, and Capacity Design in Communication and Computer Networks
Routing, Flow, and Capacity Design in Communication and Computer Networks
A survey on benders decomposition applied to fixed-charge network design problems
Computers and Operations Research
Introduction to Stochastic Programming
Introduction to Stochastic Programming
Metric inequalities and the Network Loading Problem
Discrete Optimization
Exact solution of multicommodity network optimization problems with general step cost functions
Operations Research Letters
The two layer network design problem
INOC'11 Proceedings of the 5th international conference on Network optimization
Solving survivable two-layer network design problems by metric inequalities
Computational Optimization and Applications
Dynamic routing at different layers in IP-over-WDM networks - Maximizing energy savings
Optical Switching and Networking
Design of Survivable Networks Using Three-and Four-Partition Facets
Operations Research
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
INFORMS Journal on Computing
| Hi-index | 0.00 |
Benders decomposition has been widely used for solving network design problems. In this paper, we use a branch-and-cut algorithm to improve the separation procedure of Gabrel et al. and Knippel et al. for capacitated network design. We detail experiments on bi-layer networks, comparing with Knippel's previous results.