Bernard Fortz

According to our database1, Bernard Fortz authored at least 48 papers between 2000 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Special issue on bilevel optimization.
EURO J. Comput. Optim., 2020

2019
A study of general and security Stackelberg game formulations.
Eur. J. Oper. Res., 2019

A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs.
4OR, 2019

2018
Preface: Recent advances in telecommunications networks planning and operation.
Networks, 2018

Extended formulation for hop constrained distribution network configuration problems.
Eur. J. Oper. Res., 2018

Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol.
Discret. Appl. Math., 2018

The 2 edge-disjoint 3-paths polyhedron.
Ann. des Télécommunications, 2018

2017
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem.
Networks, 2017

Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem.
Eur. J. Oper. Res., 2017

Models for the piecewise linear unsplittable multicommodity flow problems.
Eur. J. Oper. Res., 2017

Location of stations in a one-way electric car sharing system.
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Sub-hour Unit Commitment MILP Model with Benchmark Problem Instances.
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016
Distributed Monitoring Problem.
Electron. Notes Discret. Math., 2016

Editorial.
EURO J. Comput. Optim., 2016

On the convex piecewise linear unsplittable multicommodity flow problem.
Proceedings of the 12th International Conference on the Design of Reliable Communication Networks, 2016

2015
A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem.
Networks, 2015

On the hop-constrained survivable network design problem with reliable edges.
Comput. Oper. Res., 2015

Robust cooperative monitoring problem.
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015

Lagrangian relaxation for the time-dependent combined network design and routing problem.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014
Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Time-dependent combined network design and routing optimization.
Proceedings of the IEEE International Conference on Communications, 2014

Methods for time-dependent combined network design and routing optimization.
Proceedings of the IEEE Global Communications Conference, 2014

Branch-and-cut strategies for a multi-period network design and routing problem.
Proceedings of the International Conference on Control, 2014

2013
A branch-and-cut algorithm for the ring spur assignment problem.
Networks, 2013

Stochastic binary problems with simple penalties for capacity constraints violations.
Math. Program., 2013

Benders Decomposition for the Hop-Constrained Survivable Network Design Problem.
INFORMS J. Comput., 2013

Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs.
Electron. Notes Discret. Math., 2013

SI on computational methods for network optimization problems.
EURO J. Comput. Optim., 2013

Intra-domain traffic engineering with shortest path routing protocols.
Ann. Oper. Res., 2013

2012
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty.
Networks, 2012

2011
Editorial: Preface to the Special Issue.
Networks, 2011

Efficient techniques and tools for intra-domain traffic engineering.
Int. Trans. Oper. Res., 2011

Applications of meta-heuristics to traffic engineering in IP networks.
Int. Trans. Oper. Res., 2011

Improved Formulations for the Ring Spur Assignment Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

On the Hazmat Transport Network Design Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
Easy distributions for combinatorial optimization problems with probabilistic constraints.
Oper. Res. Lett., 2010

On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Optimization of OSPF Routing in IP Networks.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009
An improved Benders decomposition applied to a multi-layer network design problem.
Oper. Res. Lett., 2009

2006
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.
Math. Program., 2006

Polyhedral Approaches to the Design of Survivable Networks.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2004
Increasing Internet Capacity Using Local Search.
Comput. Optim. Appl., 2004

Two-Connected Networks with Rings of Bounded Cardinality.
Comput. Optim. Appl., 2004

2003
A tabu search algorithm for self-healing ring network design.
Eur. J. Oper. Res., 2003

2002
Polyhedral results for two-connected networks with bounded rings.
Math. Program., 2002

Optimizing OSPF/IS-IS weights in a changing world.
IEEE J. Sel. Areas Commun., 2002

2000
Solving the Two-Connected Network with Bounded Meshes Problem.
Oper. Res., 2000

Internet Traffic Engineering by Optimizing OSPF Weights.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000


  Loading...