Olivier Klopfenstein

According to our database, Olivier Klopfenstein authored at least 22 papers between 2005 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2018

A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem.

Sylvie Borne, Éric Gourdin, Olivier Klopfenstein, Ali Ridha Mahjoub

Comput. Ind. Eng., 2018

2017

Hedging under multiple risk constraints.

Ying Jiao, Olivier Klopfenstein, Peter Tankov

Finance Stochastics, 2017

2013

Robust capacity assignment solutions for telecommunications networks with uncertain demands.

Frédéric Babonneau, Jean-Philippe Vial, Olivier Klopfenstein, Adam Ouorou

Networks, 2013

2012

Cover inequalities for robust knapsack sets - Application to the robust bandwidth packing problem.

Olivier Klopfenstein, Dritan Nace

Networks, 2012

Dimensioning X2 backhaul link in LTE networks.

Alexandre Blogowski, Olivier Klopfenstein, Benjamin Renard

Proceedings of IEEE International Conference on Communications, 2012

2011

Single-path routing of stochastic flows in networks.

Olivier Klopfenstein

Oper. Res. Lett., 2011

2010

Optimal routing for minimizing the maximal link congestion.

Hassan L. Hijazi, Olivier Klopfenstein

Electron. Notes Discret. Math., 2010

Solving chance-constrained combinatorial problems to optimality.

Olivier Klopfenstein

Comput. Optim. Appl., 2010

Performance-Oriented Routing in Telecommunication Networks.

Hassan L. Hijazi, Olivier Klopfenstein

Proceedings of the Global Communications Conference, 2010

Optimization of OSPF Routing in IP Networks.

Andreas Bley, Bernard Fortz, Éric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michal Pióro, Artur Tomaszewski, Hakan Ümit

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

Tractable algorithms for chance-constrained combinatorial problems.

Olivier Klopfenstein

RAIRO Oper. Res., 2009

2008

Optimisation robuste des réseaux de télécommunications. (Robust Optimization of Telecommunication networks).

Olivier Klopfenstein

PhD thesis, 2008

A robust approach to the chance-constrained knapsack problem.

Olivier Klopfenstein, Dritan Nace

Oper. Res. Lett., 2008

Rerouting tunnels for MPLS network resource optimization.

Olivier Klopfenstein

Eur. J. Oper. Res., 2008

Max-min fairness in multi-commodity flows.

Dritan Nace, Nhat Linh Doan, Olivier Klopfenstein, Alfred Bashllari

Comput. Oper. Res., 2008

Multi-period capacitated location with modular equipments.

Éric Gourdin, Olivier Klopfenstein

Comput. Oper. Res., 2008

New trends in locational analysis.

S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick M. Ndiaye, Stefan Nickel, Blas Pelegrín

Comput. Oper. Res., 2008

Max-min fair survivable networks.

Alfred Bashllari, Dritan Nace, Éric Gourdin, Olivier Klopfenstein

Ann. des Télécommunications, 2008

2007

Robust Optimization for Selecting NetFlow Points of Measurement in an IP Network.

Mustapha Bouhtou, Olivier Klopfenstein

Proceedings of the Global Communications Conference, 2007

Robust pre-provisioning of local protection resources in MPLS networks.

Olivier Klopfenstein

Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006

Choosing Weights for IP Network Dimensioning Optimization.

Olivier Klopfenstein, Sebastien Mamy

Proceedings of the 11th IEEE Symposium on Computers and Communications (ISCC 2006), 2006

2005

A randomized rounding heuristic to reroute tunnels in MPLS networks.

Olivier Klopfenstein

Proceedings of the 5th International Workshop on Design of Reliable Communication Networks, 2005