The following pages link to Bernard Fortz (Q325371):
Displaying 39 items.
- Distributed monitoring problem (Q325372) (← links)
- On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
- Easy distributions for combinatorial optimization problems with probabilistic constraints (Q614036) (← links)
- Increasing internet capacity using local search (Q702469) (← links)
- (Q1038107) (redirect page) (← links)
- An improved Benders decomposition applied to a multi-layer network design problem (Q1038109) (← links)
- A tabu search algorithm for self-healing ring network design. (Q1410612) (← links)
- Two-connected networks with rings of bounded cardinality (Q1424779) (← links)
- Extended formulation for hop constrained distribution network configuration problems (Q1681271) (← links)
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol (Q1686055) (← links)
- Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem (Q1752190) (← links)
- Models for the piecewise linear unsplittable multicommodity flow problems (Q1753554) (← links)
- Polyhedral results for two-connected networks with bounded rings (Q1849257) (← links)
- Stochastic binary problems with simple penalties for capacity constraints violations (Q1949274) (← links)
- A study of general and security Stackelberg game formulations (Q1999631) (← links)
- Strategic bidding in price coupled regions (Q2155379) (← links)
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut (Q2583145) (← links)
- Benders decomposition for network design covering problems (Q2669611) (← links)
- Applications of meta-heuristics to traffic engineering in IP networks (Q3087845) (← links)
- Efficient techniques and tools for intra-domain traffic engineering (Q3087851) (← links)
- Improved Formulations for the Ring Spur Assignment Problem (Q3091479) (← links)
- On the Hazmat Transport Network Design Problem (Q3091516) (← links)
- Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol (Q3195334) (← links)
- Optimization of OSPF Routing in IP Networks (Q3404471) (← links)
- (Q4515976) (← links)
- Solving the Two-Connected Network with Bounded Meshes Problem (Q4530666) (← links)
- A Lagrangian heuristic algorithm for the time‐dependent combined network design and routing problem (Q4565776) (← links)
- Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty (Q4648697) (← links)
- (Q4793422) (← links)
- (Q5294055) (← links)
- A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5900973) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5919993) (← links)
- Fill‐rate service level constrained distribution network design (Q6060687) (← links)
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints (Q6066244) (← links)
- Loads scheduling for demand response in energy communities (Q6068684) (← links)
- Preprocessing for segment routing optimization (Q6180032) (← links)
- Min–max optimization of node‐targeted attacks in service networks (Q6196869) (← links)
