Bernard Fortz
According to our database^{1},
Bernard Fortz
authored at least 48 papers
between 2000 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2020
EURO J. Comput. Optim., 2020
2019
Eur. J. Oper. Res., 2019
A Branch & Price algorithm for the minimum cost clique cover problem in maxpoint tolerance graphs.
4OR, 2019
2018
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
Ann. des Télécommunications, 2018
2017
A Lagrangian heuristic algorithm for the timedependent 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
Eur. J. Oper. Res., 2017
Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017
Proceedings of the Computational Science and Its Applications  ICCSA 2017, 2017
2016
Electron. Notes Discret. Math., 2016
EURO J. Comput. Optim., 2016
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
Comput. Oper. Res., 2015
Proceedings of the 7th International Workshop on Reliable Networks Design and Modeling, 2015
Lagrangian relaxation for the timedependent 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
Proceedings of the IEEE International Conference on Communications, 2014
Proceedings of the IEEE Global Communications Conference, 2014
Proceedings of the International Conference on Control, 2014
2013
Networks, 2013
Stochastic binary problems with simple penalties for capacity constraints violations.
Math. Program., 2013
INFORMS J. Comput., 2013
DantzigWolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs.
Electron. Notes Discret. Math., 2013
EURO J. Comput. Optim., 2013
Ann. Oper. Res., 2013
2012
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty.
Networks, 2012
2011
Networks, 2011
Int. Trans. Oper. Res., 2011
Int. Trans. Oper. Res., 2011
Proceedings of the Network Optimization  5th International Conference, 2011
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 CologneTwente Workshop on Graphs and Combinatorial Optimization, 2010
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010
2009
An improved Benders decomposition applied to a multilayer network design problem.
Oper. Res. Lett., 2009
2006
Twoedge connected subgraphs with bounded rings: Polyhedral results and BranchandCut.
Math. Program., 2006
Proceedings of the Handbook of Optimization in Telecommunications, 2006
2004
Comput. Optim. Appl., 2004
Comput. Optim. Appl., 2004
2003
Eur. J. Oper. Res., 2003
2002
Math. Program., 2002
IEEE J. Sel. Areas Commun., 2002
2000
Oper. Res., 2000
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000