The convex hull of two core capacitated network design problems
Mathematical Programming: Series A and B
Designing least-cost nonblocking broadband networks
Journal of Algorithms
Minimum cost capacity installation for multicommodity network flows
Mathematical Programming: Series A and B - Special issue on computational integer programming
Mathematics of Operations Research
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms for provisioning virtual private networks in the hose model
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Tabu Search for a Network Loading Problem with Multiple Facilities
Journal of Heuristics
Primal-Dual Algorithms for Connected Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Operations Research
Adjustable robust solutions of uncertain linear programs
Mathematical Programming: Series A and B
Strong Formulations of Robust Mixed 0–1 Programming
Mathematical Programming: Series A and B
Provisioning virtual private networks under traffic uncertainty
Networks - Special Issue on Multicommodity Flows and Network Design
Restricted Robust Uniform Matroid Maximization Under Interval Uncertainty
Mathematical Programming: Series A and B
Valid inequalities for mixed integer linear programs
Mathematical Programming: Series A and B
Selected topics in robust convex optimization
Mathematical Programming: Series A and B
Virtual Private Network Design: A Proof of the Tree Routing Conjecture on Ring Networks
SIAM Journal on Discrete Mathematics
The Integer Knapsack Cover Polyhedron
SIAM Journal on Discrete Mathematics
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Two-Stage Robust Network Flow and Design Under Demand Uncertainty
Operations Research
A short proof of the VPN Tree Routing Conjecture on ring networks
Operations Research Letters
Metric inequalities and the Network Loading Problem
Discrete Optimization
Robust solutions of uncertain linear programs
Operations Research Letters
Dynamic routing at different layers in IP-over-WDM networks - Maximizing energy savings
Optical Switching and Networking
The robust network loading problem with dynamic routing
Computational Optimization and Applications
| Hi-index | 0.00 |
We consider the network loading problem (NLP) under a polyhedral uncertainty description of traffic demands. After giving a compact multicommodity flow formulation of the problem, we state a decomposition property obtained from projecting out the flow variables. This property considerably simplifies the resulting polyhedral analysis and computations by doing away with metric inequalities. Then we focus on a specific choice of the uncertainty description, called the “hose model,” which specifies aggregate traffic upper bounds for selected endpoints of the network. We study the polyhedral aspects of the NLP under hose demand uncertainty and use the results as the basis of an efficient branch-and-cut algorithm. The results of extensive computational experiments on well-known network design instances are reported.