Bernard Fortz

 International Network Optimization Conference 2007 (INOC 2007)

 European Network Optimization Group

 The TOTEM project

 Presentations

• Combinatorial optimisation and survivable network design (invited presentation at ALGOTEL 2004).
• Combinatorial Optimisation and Telecommunications Handouts of the doctoral course given at CORE in September 2003.
  • Course overview
  • Basic problems, tools and techniques
  • Design of survivable networks
  • Fixed charge network design problems
  • Network synthesis problems
  • Routing problems and traffic engineering in IP networks

 Publications

Book

• B. Fortz.
  Design of Survivable Networks with Bounded Rings.
  Volume 2 of Network Theory and Applications. Kluwer Academic Publishers, 2000.

Published papers

• B. Fortz, A.R. Mahjoub, S.T. Mc Cormick, and P. Pesneau
  Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
  Mathematical Programming, 105(1):85-111, 2006.
  
• B. Fortz and M. Thorup.
  Increasing Internet Capacity Using Local Search
  Computational Optimization and Applications, 29(1):13-48, 2004.
  
• B. Fortz and M. Labbé.
  Two-connected networks with rings of bounded cardinality
  Computational Optimization and Applications, 27(2):123-148, 2004.
  
• B. Fortz and M. Thorup.
  Robust optimization of OSPF/IS-IS weights.
  In W. Ben-Ameur and A. Petrowski, editors, Proc. INOC 2003, pages 225-230, October 2003.
  
• B. Fortz, P. Soriano, and C. Wynants.
  A Tabu Search Algorithm for Self-Healing Ring Network Design
  European Journal of Operational Research, 151(2):280-295, 2003.
  
• B. Fortz, J. Rexford and M. Thorup.
  Traffic engineering with traditional IP routing protocols
  IEEE Communications Magazine, 40(10):118-124, 2002.
  
• B. Fortz and M. Labbé.
  Polyhedral results for two-connected networks with bounded rings
  Mathematical Programming, 93(1):27-54, 2002.
  
• C. Allal, B. Colson, and B. Fortz.
  A Park & Ride integrated system.
  Chapter 13 in M. Patriksson and M. Labbé, editors, Transportation Planning, State of the Art, pages 213-228. Kluwer Academic Publishers, 2002.
  
• B. Fortz and M. Thorup.
  Optimizing OSPF/IS-IS Weights in a Changing World
  IEEE Journal on Selected Areas in Communications, 20(4):756-767, 2002.
  
• B. Fortz and M. Thorup.
  Internet Traffic Engineering by Optimizing OSPF Weights
  In Proc. 19th IEEE Conf. on Computer Communications (INFOCOM), pages 519-528, 2000.
• B. Fortz, M. Labbé, and F. Maffioli.
  Solving the two-connected network with bounded meshes problem.
  Operations Research, 48(6):866-877, 2000.
  
• P. Soriano, C. Wynants, R. Séguin, M. Labbé, M. Gendreau, and B. Fortz.
  Design and dimensioning of survivable SDH networks.
  Chapter 9 in B. Sansò and P. Soriano, editors, Telecommunications network planning, pages 147-168. Kluwer Academic Publishers, 1999.
  
• B. Fortz, M. Labbé, and F. Maffioli.
  Methods for designing reliable networks with bounded meshes.
  In V. Ramaswami and P.E. Wirth, editors, Teletraffic Contributions for the Information Age, volume 2a of Teletraffic Science and Engineering, pages 341-350. Elsevier, 1997.
  
  

Preprints and working papers

• B. Fortz and M. Labbé.
  A tabu search heuristic for the design of two-connected networks with bounded rings
  IAG Working Paper 74/02, Université Catholique de Louvain, 2002.
  
• B. Fortz.
  On the evaluation of the reliability of OSPF routing in IP networks
  In Proc. SSGRR 2002w International Conference- Advances in Infrastructure for e-Business, e-Education, e-Science, and e-Medicine on the Internet, January 2002.
  

 Contact

Unité de gestion logistique et modélisation (POMS)
Université Catholique de Louvain
Institut d'Administration et de Gestion
Place des Doyens, 1
B-1348 Louvain-la-Neuve
BELGIUM
Tel: +32-10-47 83 88
Fax: +32-10-47 83 24
E-mail: fortz@poms.ucl.ac.be
WWW: http://www.poms.ucl.ac.be/staff/bf/en/