Search

Pages

1. • 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
2. • 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
3. • Speech

   • 

   A network Design Problem in Telecommunication

   Botton, Quentin[UCL] Fortz, Bernard[UCL] Gouveia, Luis (2008) 5th CEMS Research Seminar — Riezlern
4. • Speech

   • 

   The K-Edge 3-Hop Constrained Network Design Polyhedron

   Botton, Quentin[UCL] Fortz, Bernard[UCL] Gouveia, Luis (2008) 9th INFORMS Telecommunications Conference — Baltimore
5. • Speech

   • 

   The Interaction of IGP Weight Optimization with BGP

   Cerav-Erbas, S. Quoitin, Bruno Fortz, Bernard[UCL] Delcourt, B. (2006) Proceedings of ICISP 2006 —
6. • 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)
7. • WorkingPaper

   • 

   Decomposition Methods for the Optimization of Survivable Telecommunications Networks

   Fortz, Bernard Botton, Quentin (2005)
8. • Journal article

   • 

   Polyhedral results for two-connected networks with bounded rings

   Fortz, Bernard[UCL] Labbé, Marylène[UCL] (2002) Mathematical Programming — Vol. 93, no. 1, p. 27-54 (2002)
9. • WorkingPaper

   • 

   A tabu search heuristic for the design of two-connected networks with bounded rings

   Fortz, Bernard Labbé, Martine (2002)
10. • WorkingPaper

    • 

    Improved benders decomposition applied to a multi-layer network design problem

    Fortz, Bernard[UCL] Poss, Michael (2008)
11. • WorkingPaper

    • 

    Efficient Techniques and Tools for Intra-Domain Traffic Engineering

    Fortz, Bernard[UCL] Umit, Hakan[UCL] (2008)
12. • WorkingPaper

    • 

    On the evaluation of the reliability of OSPF routing in IP networks

    Fortz, Bernard[UCL] (2001)
13. • WorkingPaper

    • 

    Two-connected networks with rings of bounded cardinality

    Fortz, Bernard[UCL] (2002)
14. • WorkingPaper

    • 

    Twedge connected subgraphs with bounded rings : Polyhedral results and branch-and-Cut

    Fortz, Bernard Ridha Mahjoub, A. McCormick, Thomas Pesneau, Pierre (2003)
15. • WorkingPaper

    • 

    Optimizing OSPF/IS-IS Weights in a Changing World

    Fortz, Bernard[UCL] Thorup, Mikkel (2000)
16. • WorkingPaper

    • 

    Polyhedral results for two connected networks with bounded rings

    Fortz, Bernard[UCL] Labbé, Marylène[UCL] (2001)
17. • Speech

    • 

    Robust optimization of OSPF/IS-IS weights

    Fortz, Bernard[UCL] Thorup, Mikkel (2003) Proceedings INOC 2003 — Evry
18. • 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
19. • Speech

    • 

    Decomposition methods for the optimization of survivable telecommunications networks

    Botton, Quentin Fortz, Bernard[UCL] (2006) Belgian national Operations Research conference — Gent
20. • WorkingPaper

    • 

    Traffic Engineering With Traditional IP Routing Protocols

    Fortz, Bernard[UCL] Rexford, Jennifer Thorup, Mikkel (2002)
21. • Journal article

    • 

    Increasing Internet Capacity Using Local Search

    Fortz, Bernard[UCL] Thorup, Mikkel (2004) Computational Optimization and Applications — Vol. 29, p. 13-48 (2004)
22. • 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)
23. • Speech

    • 

    The K-Edge 3-Hop Constrained Network Design Polyhedron

    Botton, Quentin[UCL] Fortz, Bernard[UCL] Gouveia, Luis (2008) ORBEL 22, Belgian National Operations Research Conference — Bruxelles
24. • 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)
25. • WorkingPaper

    • 

    Benders decomposition for the hop-constrained survivable network design problem

    Botton, Quentin[UCL] Fortz, Bernard Poss, Michael Gouveia, Luis (2011)

Pages