default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlivier Klopfenstein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j14]Sylvie Borne, Éric Gourdin, Olivier Klopfenstein, Ali Ridha Mahjoub:
A Branch-and-Cut algorithm for the Capacitated Multi-Failure Survivable Network Design problem. Comput. Ind. Eng. 124: 582-603 (2018)- 2017
- [j13]Ying Jiao, Olivier Klopfenstein, Peter Tankov:
Hedging under multiple risk constraints. Finance Stochastics 21(2): 361-396 (2017) - 2013
- [j12]Frédéric Babonneau
, Jean-Philippe Vial, Olivier Klopfenstein, Adam Ouorou:
Robust capacity assignment solutions for telecommunications networks with uncertain demands. Networks 62(4): 255-272 (2013) - 2012
- [j11]Olivier Klopfenstein, Dritan Nace:
Cover inequalities for robust knapsack sets - Application to the robust bandwidth packing problem. Networks 59(1): 59-72 (2012) - [c6]Alexandre Blogowski, Olivier Klopfenstein, Benjamin Renard:
Dimensioning X2 backhaul link in LTE networks. ICC 2012: 2768-2773 - 2011
- [j10]Olivier Klopfenstein:
Single-path routing of stochastic flows in networks. Oper. Res. Lett. 39(2): 92-98 (2011) - 2010
- [j9]Olivier Klopfenstein:
Solving chance-constrained combinatorial problems to optimality. Comput. Optim. Appl. 45(3): 607-638 (2010) - [j8]Hassan L. Hijazi, Olivier Klopfenstein:
Optimal routing for minimizing the maximal link congestion. Electron. Notes Discret. Math. 36: 1145-1152 (2010) - [c5]Hassan L. Hijazi, Olivier Klopfenstein:
Performance-Oriented Routing in Telecommunication Networks. GLOBECOM 2010: 1-5 - [p1]Andreas Bley, Bernard Fortz, Éric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michal Pióro, Artur Tomaszewski, Hakan Ümit:
Optimization of OSPF Routing in IP Networks. Graphs and Algorithms in Communication Networks 2010: 199-240
2000 – 2009
- 2009
- [j7]Olivier Klopfenstein:
Tractable algorithms for chance-constrained combinatorial problems. RAIRO Oper. Res. 43(2): 157-187 (2009) - 2008
- [b1]Olivier Klopfenstein:
Optimisation robuste des réseaux de télécommunications. (Robust Optimization of Telecommunication networks). University of Technology of Compiègne, France, 2008 - [j6]Alfred Bashllari, Dritan Nace, Éric Gourdin, Olivier Klopfenstein:
Max-min fair survivable networks. Ann. des Télécommunications 63(9-10): 511-522 (2008) - [j5]Dritan Nace, Nhat Linh Doan, Olivier Klopfenstein, Alfred Bashllari:
Max-min fairness in multi-commodity flows. Comput. Oper. Res. 35(2): 557-573 (2008) - [j4]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:
New trends in locational analysis. Comput. Oper. Res. 35(3): 649-650 (2008) - [j3]Éric Gourdin, Olivier Klopfenstein:
Multi-period capacitated location with modular equipments. Comput. Oper. Res. 35(3): 661-682 (2008) - [j2]Olivier Klopfenstein:
Rerouting tunnels for MPLS network resource optimization. Eur. J. Oper. Res. 188(1): 293-312 (2008) - [j1]Olivier Klopfenstein, Dritan Nace:
A robust approach to the chance-constrained knapsack problem. Oper. Res. Lett. 36(5): 628-632 (2008) - 2007
- [c4]Olivier Klopfenstein:
Robust pre-provisioning of local protection resources in MPLS networks. DRCN 2007: 1-7 - [c3]Mustapha Bouhtou, Olivier Klopfenstein:
Robust Optimization for Selecting NetFlow Points of Measurement in an IP Network. GLOBECOM 2007: 2581-2585 - 2006
- [c2]Olivier Klopfenstein, Sebastien Mamy:
Choosing Weights for IP Network Dimensioning Optimization. ISCC 2006: 994-999 - 2005
- [c1]Olivier Klopfenstein:
A randomized rounding heuristic to reroute tunnels in MPLS networks. DRCN 2005: 461-468
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
