User menu

Accès à distance ? S'identifier sur le proxy UCLouvain

All Publications

Displaying 1 - 25 of 32 results.

Pages

    • WorkingPaper
    Decomposition Methods for the Optimization of Survivable Telecommunications Networks
    Fortz, Bernard Botton, Quentin (2005)
    • WorkingPaper
    Two-connected networks with rings of bounded cardinality
    Fortz, Bernard[UCL] (2002)
    • Speech
    The Interaction of IGP Weight Optimization with BGP
    Cerav-Erbas, S. Quoitin, Bruno Fortz, Bernard[UCL] Delcourt, B. (2006) Proceedings of ICISP 2006 —
    • Speech
    Decomposition methods for the optimization of survivable telecommunications networks
    Botton, Quentin Fortz, Bernard[UCL] (2006) Belgian national Operations Research conference — Gent
    • Speech
    Robust optimization of OSPF/IS-IS weights
    Fortz, Bernard[UCL] Thorup, Mikkel (2003) Proceedings INOC 2003 — Evry
    • WorkingPaper
    Benders decomposition for the hop-constrained survivable network design problem
    Botton, Quentin[UCL] Fortz, Bernard Poss, Michael Gouveia, Luis (2011)
    • WorkingPaper
    Polyhedral results for two connected networks with bounded rings
    Fortz, Bernard[UCL] Labbé, Marylène[UCL] (2001)
    • Journal article
    Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut
    Fortz, Bernard[UCL] Pesneau, Pierre Mc Cormick S., Thomas Mahjoub Ali, Ridha (2005) Mathematical Programming — Vol. 105, no. 1, p. 85-111 (2005)
    • WorkingPaper
    Twedge connected subgraphs with bounded rings : Polyhedral results and branch-and-Cut
    Fortz, Bernard Ridha Mahjoub, A. McCormick, Thomas Pesneau, Pierre (2003)
    • Journal article
    Intra-domain traffic engineering with shortest path routing protocols
    Altin, Aysegul Fortz, Bernard[UCL] Thorup, Mikkel Umit, Hakan[UCL] (2009) 4 O R : quarterly journal of the Belgian, French and Italian operations research societies — Vol. 7, no. 4, p. 301-335 (2009)
    • Journal article
    Two-connected networks with rings of bounded cardinality
    Fortz, Bernard[UCL] Labbé, Martine (2004) Computational Optimization and Applications — Vol. 27, p. 123-148 (2004)
    • Speech
    Extended node-arc formulation for the hop-constrained network design problem
    Botton, Quentin Fortz, Bernard[UCL] (2006) EUROXXI, 21st European Conference on Operational Research — Reykjavik
    • Journal article
    Increasing Internet Capacity Using Local Search
    Fortz, Bernard[UCL] Thorup, Mikkel (2004) Computational Optimization and Applications — Vol. 29, p. 13-48 (2004)
    • WorkingPaper
    Efficient Techniques and Tools for Intra-Domain Traffic Engineering
    Fortz, Bernard[UCL] Umit, Hakan[UCL] (2008)
    • Speech
    Oblivious OSPF routing with weight optimization under polyhedral uncertainty
    Altin, Aysegul Fortz, Bernard[UCL] Umit, Hakan[UCL] (2009) International Network Optimization Conference — Pisa, Italy
    • WorkingPaper
    Traffic Engineering With Traditional IP Routing Protocols
    Fortz, Bernard[UCL] Rexford, Jennifer Thorup, Mikkel (2002)
    • WorkingPaper
    On the evaluation of the reliability of OSPF routing in IP networks
    Fortz, Bernard[UCL] (2001)
    • BookChapter
    Optimisation of OSPF Routing in IP Networks
    Bley, Andreas Fortz, Bernard[UCL] Gourdin, Eric Holmberg, Kaj Klopfenstein, Olivier Pioro, Michal Tomaszewski, Artur Umit, Hakan[UCL] (2010) Graphs and Algorithms — [ISBN : 978-3-642-02249-4]
    • WorkingPaper
    Comparison of heuristic procedures for an integrated model for production and distribution planning in an environment of shared resources
    Strack, Géraldine[UCL] Fortz, Bernard Riane, Fouad[FUCAM] Van Vyve, Mathieu[UCL] (2011)
    • Speech
    The K-Edge 3-Hop Constrained Network Design Polyhedron
    Botton, Quentin[UCL] Fortz, Bernard[UCL] Gouveia, Luis (2008) 9th INFORMS Telecommunications Conference — Baltimore
    • Speech
    Extended Node-Arc Formulations for the K-Edge Disjoint Hop-Constrained Network Design Problem
    Botton, Quentin[UCL] Fortz, Bernard[UCL] Gouveia, Luis (2008) Optimization 2007, sixth International Conference on Optimization — Porto
    • Speech
    A network Design Problem in Telecommunication
    Botton, Quentin[UCL] Fortz, Bernard[UCL] Gouveia, Luis (2008) 5th CEMS Research Seminar — Riezlern
    • Journal article
    A tabu search algorithm for self-healing ring network design
    Fortz, Bernard[UCL] Soriano, P. Wynants, C. (2003) European Journal of Operational Research — Vol. 151, no. 2, p. 280-295 (2003)
    • Speech
    Extended Node-Arc Formulations for the K-Edge Disjoint Hop-Constrained Network Design Problem
    Botton, Quentin[UCL] Fortz, Bernard[UCL] Gouveia, Luis (2008) INOC 2007, International Network Optimization Conference — Spa
    • Journal article
    Benders decomposition for the hop-constrained survivable network design problem
    Botton, Quentin[UCL] Fortz, Bernard Poss, Michael Gouveia, Luis (2011) I N F O R M S Journal on Computing — p. 30 (2011)

Pages