Bernard Fortz
Bernard Fortz
HEC Liége, management school of the University of Liège
Verified email at
Cited by
Cited by
Internet traffic engineering by optimizing OSPF weights
B Fortz, M Thorup
Proceedings IEEE INFOCOM 2000. conference on computer communications …, 2000
Optimizing OSPF/IS-IS weights in a changing world
B Fortz, M Thorup
IEEE journal on selected areas in communications 20 (4), 756-767, 2002
Traffic engineering with traditional IP routing protocols
B Fortz, J Rexford, M Thorup
IEEE communications Magazine 40 (10), 118-124, 2002
Increasing internet capacity using local search
B Fortz, M Thorup
Computational Optimization and Applications 29, 13-48, 2004
Robust optimization of OSPF/IS-IS weights
B Fortz, M Thorup
Proc. INoC 20, 225-230, 2003
An improved Benders decomposition applied to a multi-layer network design problem
B Fortz, M Poss
Operations research letters 37 (5), 359-364, 2009
Benders decomposition for the hop-constrained survivable network design problem
Q Botton, B Fortz, L Gouveia, M Poss
INFORMS journal on computing 25 (1), 13-26, 2013
Intra-domain traffic engineering with shortest path routing protocols
A Altın, B Fortz, M Thorup, H Ümit
Annals of Operations Research 204 (1), 65-95, 2013
Solving the two-connected network with bounded meshes problem
B Fortz, M Labbé, F Maffioli
Operations Research 48 (6), 866-877, 2000
On the hazmat transport network design problem
E Amaldi, M Bruglieri, B Fortz
International Conference on Network Optimization, 327-338, 2011
A Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty
H Çalık, B Fortz
Transportation Research Part B: Methodological 125, 121-150, 2019
Design and dimensioning of survivable SDH/SONET networks
P Soriano, C Wynants, R Séguin, M Labbé, M Gendreau, B Fortz
Telecommunications network planning, 147-167, 1999
Design of survivable networks with bounded rings
B Fortz
Springer Science & Business Media, 2013
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty
A Altin, B Fortz, H Ümit
Networks 60 (2), 132-139, 2012
Polyhedral results for two-connected networks with bounded rings
B Fortz, M Labbé
Mathematical Programming 93, 27-54, 2002
A study of general and security Stackelberg game formulations
C Casorrán, B Fortz, M Labbé, F Ordóñez
European journal of operational research 278 (3), 855-868, 2019
Intra-domain traffic engineering with shortest path routing protocols
A Altın, B Fortz, M Thorup, H Ümit
4OR: A Quarterly Journal of Operations Research 7 (4), 301-335, 2009
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
B Fortz, AR Mahjoub, ST McCormick, P Pesneau
Mathematical Programming 105, 85-111, 2006
Methods and systems for optimizing network traffic
M Thorup, B Fortz
US Patent 7,185,104, 2007
A tabu search algorithm for self-healing ring network design
B Fortz, P Soriano, C Wynants
European Journal of Operational Research 151 (2), 280-295, 2003
The system can't perform the operation now. Try again later.
Articles 1–20