An approach to robust network design in telecommunications
RAIRO-Oper. Res., 41 4 (2007) 411-426
Published online: 2007-10-11
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
A Distributed Method for Optimal Capacity Reservation
Nicholas Moehle, Xinyue Shen, Zhi-Quan Luo and Stephen BoydJournal of Optimization Theory and Applications 182 (3) 1130 (2019)
https://doi.org/10.1007/s10957-019-01528-5
Algorithm to solve a chance‐constrained network capacity design problem with stochastic demands and finite support
Kathryn M. Schumacher, Richard Li‐Yang Chen, Amy E.M. Cohn and Jeremy CastaingNaval Research Logistics (NRL) 63 (3) 236 (2016)
https://doi.org/10.1002/nav.21685
Robust capacity assignment solutions for telecommunications networks with uncertain demands
F. Babonneau, J.‐P. Vial, O. Klopfenstein and A. OuorouNetworks 62 (4) 255 (2013)
https://doi.org/10.1002/net.21515
Tractable approximations to a robust capacity assignment model in telecommunications under demand uncertainty
Adam OuorouComputers & Operations Research 40 (1) 318 (2013)
https://doi.org/10.1016/j.cor.2012.07.001
Single-path routing of stochastic flows in networks
Olivier KlopfensteinOperations Research Letters 39 (2) 92 (2011)
https://doi.org/10.1016/j.orl.2011.02.005
On 2-stage robust LP with RHS uncertainty: complexity results and applications
Michel MinouxJournal of Global Optimization 49 (3) 521 (2011)
https://doi.org/10.1007/s10898-010-9645-2
Network Optimization
Adam OuorouLecture Notes in Computer Science, Network Optimization 6701 277 (2011)
https://doi.org/10.1007/978-3-642-21527-8_32
Volume-oriented routing and its modifications
Mateusz Żotkiewicz and Walid Ben-AmeurTelecommunication Systems (2011)
https://doi.org/10.1007/s11235-011-9602-5
Robust network optimization under polyhedral demand uncertainty is NP-hard
M. MinouxDiscrete Applied Mathematics 158 (5) 597 (2010)
https://doi.org/10.1016/j.dam.2009.09.025
Robust network design in telecommunications under polytope demand uncertainty
Claude Lemaréchal, Adam Ouorou and Georgios PetrouEuropean Journal of Operational Research 206 (3) 634 (2010)
https://doi.org/10.1016/j.ejor.2010.03.007
Optimal routing for minimizing the maximal link congestion
Hassan Hijazi and Olivier KlopfensteinElectronic Notes in Discrete Mathematics 36 1145 (2010)
https://doi.org/10.1016/j.endm.2010.05.145
A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
Adam OuorouMathematical Programming 119 (2) 239 (2009)
https://doi.org/10.1007/s10107-008-0209-x
1 (2007)
https://doi.org/10.1109/DRCN.2007.4762287