Survivable network design with demand uncertainty
From MaRDI portal
Publication:631096
DOI10.1016/j.ejor.2010.09.041zbMath1207.90028OpenAlexW2046957785MaRDI QIDQ631096
S. E. Terblanche, J. M. Hattingh, Roland Wessäly
Publication date: 22 March 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.09.041
Integer programming (90C10) Communication networks in operations research (90B18) Stochastic programming (90C15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Design of survivable networks
- Design of private backbone networks. I: Time varying traffic
- Routing and capacity assignment in backbone communication networks under time varying traffic conditions
- Linear Programming under Uncertainty
- Capacitated Network Design with Uncertain Demand
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty
- Virtual Private Network Design Under Traffic Uncertainty
- Multi-Terminal Network Flows
- Optimum Synthesis of a Network with Non-Simultaneous Multicommodity Flow Requirements
- Robust capacity expansion of network flows
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
