Fortz Bernard

Bernard Fortz

Information about the author Bernard Fortz will soon be added to the site.
Found 10 papers in total
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem
2017
During the planning of communication networks, the routing decision process...
A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem
A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem
2015
The capacitated fixed‐charge network design (FCND) problem considers the...
Intra‐domain traffic engineering with shortest path routing protocols
Intra‐domain traffic engineering with shortest path routing protocols
2013
Throughout the last decade, extensive deployment of popular intra‐domain...
Benders Decomposition for the Hop‐Constrained Survivable Network Design Problem
Benders Decomposition for the Hop‐Constrained Survivable Network Design Problem
2013
Given a graph with nonnegative edge weights and node pairs Q , we study the problem of...
Efficient techniques and tools for intra-domain traffic engineering
Efficient techniques and tools for intra-domain traffic engineering
2011
Intra-domain routing protocols are based on Shortest Path First (SPF) routing, where...
Applications of meta-heuristics to traffic engineering in IP networks
Applications of meta-heuristics to traffic engineering in IP networks
2011
Intra-domain routing protocols are based on shortest path first (SPF) routing, where...
Intra-domain traffic engineering with shortest path routing protocols
Intra-domain traffic engineering with shortest path routing protocols
2009
Throughout the last decade, extensive deployment of popular intra-domain routing...
Increasing Internet capacity using local search
Increasing Internet capacity using local search
2004
Open Shortest Path First (OSPF) is one of the most commonly used intra-domain internet...
A tabu search algorithm for self-healing ring network design
A tabu search algorithm for self-healing ring network design
2003
We consider the problem of designing self-healing rings in order to protect the...
Solving the two-connected network with bounded meshes problem
Solving the two-connected network with bounded meshes problem
2000
We study the problem of designing at minimum cost a two-connected network such that...
Papers per page: