Olivier Klopfenstein - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2018

A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problemSylvie Borne, Éric Gourdin, Olivier Klopfenstein, Ali Ridha Mahjoub. candie, 124:582-603, 2018. [doi]

2017

Hedging under multiple risk constraintsYing Jiao, Olivier Klopfenstein, Peter Tankov. fs, 21(2):361-396, 2017. [doi]

2013

Robust capacity assignment solutions for telecommunications networks with uncertain demandsFrédéric Babonneau, Jean-Philippe Vial, Olivier Klopfenstein, Adam Ouorou. networks, 62(4):255-272, 2013. [doi]

2012

Dimensioning X2 backhaul link in LTE networksAlexandre Blogowski, Olivier Klopfenstein, Benjamin Renard. icc 2012: 2768-2773 [doi]

Cover inequalities for robust knapsack sets - Application to the robust bandwidth packing problemOlivier Klopfenstein, Dritan Nace. networks, 59(1):59-72, 2012. [doi]

2011

Single-path routing of stochastic flows in networksOlivier Klopfenstein. orl, 39(2):92-98, 2011. [doi]

2010

Optimization of OSPF Routing in IP NetworksAndreas Bley, Bernard Fortz, Éric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michal Pióro, Artur Tomaszewski, Hakan Ümit. In Arie Koster, Xavier Muñoz, editors, Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks. Texts in Theoretical Computer Science. An EATCS Series, pages 199-240, Springer, 2010. [doi]

Optimal routing for minimizing the maximal link congestionHassan Hijazi, Olivier Klopfenstein. endm, 36:1145-1152, 2010. [doi]

Performance-Oriented Routing in Telecommunication NetworksHassan Hijazi, Olivier Klopfenstein. globecom 2010: 1-5 [doi]

Solving chance-constrained combinatorial problems to optimalityOlivier Klopfenstein. coap, 45(3):607-638, 2010. [doi]

2009

Tractable algorithms for chance-constrained combinatorial problemsOlivier Klopfenstein. rairo, 43(2):157-187, 2009. [doi]

2008

Max-min fair survivable networksAlfred Bashllari, Dritan Nace, Éric Gourdin, Olivier Klopfenstein. adt, 63(9-10):511-522, 2008. [doi]

Rerouting tunnels for MPLS network resource optimizationOlivier Klopfenstein. eor, 188(1):293-312, 2008. [doi]

Optimisation robuste des réseaux de télécommunications. (Robust Optimization of Telecommunication networks)Olivier Klopfenstein. PhD thesis, University of Technology of Compiègne, France, 2008. [doi]

A robust approach to the chance-constrained knapsack problemOlivier Klopfenstein, Dritan Nace. orl, 36(5):628-632, 2008. [doi]

Max-min fairness in multi-commodity flowsDritan Nace, Nhat Linh Doan, Olivier Klopfenstein, Alfred Bashllari. cor, 35(2):557-573, 2008. [doi]

Multi-period capacitated location with modular equipmentsÉric Gourdin, Olivier Klopfenstein. cor, 35(3):661-682, 2008. [doi]

2007

Robust Optimization for Selecting NetFlow Points of Measurement in an IP NetworkMustapha Bouhtou, Olivier Klopfenstein. globecom 2007: 2581-2585 [doi]

Robust pre-provisioning of local protection resources in MPLS networksOlivier Klopfenstein. drcn 2007: 1-7 [doi]

2006

Choosing Weights for IP Network Dimensioning OptimizationOlivier Klopfenstein, Sebastien Mamy. ISCC 2006: 994-999 [doi]

2005

A randomized rounding heuristic to reroute tunnels in MPLS networksOlivier Klopfenstein. drcn 2005: 461-468 [doi]

Sign in or sign up to see more results.

runs on WebDSL