Bernard Fortz

According to our database, Bernard Fortz authored at least 60 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Min-max optimization of node-targeted attacks in service networks.

Bernard Fortz, Mariusz Mycek, Michal Pióro, Artur Tomaszewski

Networks, March, 2024

Operational Research: methods and applications.

Fotios Petropoulos, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao

J. Oper. Res. Soc., March, 2024

Fill-rate service level constrained distribution network design.

Pablo Escalona, Alejandro Angulo, Luce Brotcorne, Bernard Fortz, Paulina Tapia

Int. Trans. Oper. Res., January, 2024

Fare inspection patrolling under in-station selective inspection policy.

Pablo Escalona, Luce Brotcorne, Bernard Fortz, Mario Ramirez

Ann. Oper. Res., January, 2024

2023

Preprocessing for segment routing optimization.

Hugo Callebaut, Jérôme De Boeck, Bernard Fortz

Networks, December, 2023

Loads scheduling for demand response in energy communities.

Mariam Sangaré, Eric Bourreau, Bernard Fortz, Amaury Pachurka, Michael Poss

Comput. Oper. Res., December, 2023

The Case for Stochastic Online Segment Routing under Demand Uncertainty.

Jérôme De Boeck, Bernard Fortz, Stefan Schmid

Proceedings of the IFIP Networking Conference, 2023

2022

A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints.

Bernard Fortz, Luis Gouveia, Pedro Moura

Networks, 2022

Strategic bidding in price coupled regions.

Jérôme De Boeck, Luce Brotcorne, Bernard Fortz

Math. Methods Oper. Res., 2022

Benders decomposition for network design covering problems.

Víctor Bucarey, Bernard Fortz, Natividad González-Blanco, Martine Labbé, Juan A. Mesa

Comput. Oper. Res., 2022

2021

Preface: Special issue on network analytics and optimization.

Bernard Fortz, Luis Gouveia, Christina Büsing, Markus Leitner

Networks, 2021

2020

Special issue on bilevel optimization.

Luce Brotcorne, Bernard Fortz, Martine Labbé

EURO J. Comput. Optim., 2020

2019

A study of general and security Stackelberg game formulations.

Carlos Casorrán, Bernard Fortz, Martine Labbé, Fernando Ordóñez

Eur. J. Oper. Res., 2019

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

Luciano Porretta, Daniele Catanzaro, Bjarni V. Halldórsson, Bernard Fortz

4OR, 2019

2018

Preface: Recent advances in telecommunications networks planning and operation.

Bernard Fortz, Dimitri Papadimitriou, Mauricio G. C. Resende

Networks, 2018

Extended formulation for hop constrained distribution network configuration problems.

Jérôme De Boeck, Bernard Fortz

Eur. J. Oper. Res., 2018

Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol.

Bernard Fortz, Luís Gouveia, Martim Joyce-Moniz

Discret. Appl. Math., 2018

The 2 edge-disjoint 3-paths polyhedron.

Quentin Botton, Bernard Fortz, Luis Gouveia

Ann. des Télécommunications, 2018

2017

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

Bernard Fortz, Enrico Gorgone, Dimitri Papadimitriou

Networks, 2017

Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem.

Bernard Fortz, Olga Oliveira, Cristina Requejo

Eur. J. Oper. Res., 2017

Models for the piecewise linear unsplittable multicommodity flow problems.

Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz

Eur. J. Oper. Res., 2017

Location of stations in a one-way electric car sharing system.

Hatice Calik, Bernard Fortz

Proceedings of the 2017 IEEE Symposium on Computers and Communications, 2017

Sub-hour Unit Commitment MILP Model with Benchmark Problem Instances.

Paula Carroll, Damian Flynn, Bernard Fortz, Alex Melhorn

Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017

2016

Distributed Monitoring Problem.

Dimitri Papadimitriou, Bernard Fortz

Electron. Notes Discret. Math., 2016

Editorial.

Bernard Fortz, Luis Eduardo Neves Gouveia

EURO J. Comput. Optim., 2016

On the convex piecewise linear unsplittable multicommodity flow problem.

Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz

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.

Dimitri Papadimitriou, Bernard Fortz

Networks, 2015

On the hop-constrained survivable network design problem with reliable edges.

Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia

Comput. Oper. Res., 2015

Robust cooperative monitoring problem.

Dimitri Papadimitriou, Bernard Fortz

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.

Dimitri Papadimitriou, Bernard Fortz, Enrico Gorgone

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.

Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Moniz

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Time-dependent combined network design and routing optimization.

Dimitri Papadimitriou, Bernard Fortz

Proceedings of the IEEE International Conference on Communications, 2014

Methods for time-dependent combined network design and routing optimization.

Dimitri Papadimitriou, Bernard Fortz

Proceedings of the IEEE Global Communications Conference, 2014

Branch-and-cut strategies for a multi-period network design and routing problem.

Bernard Fortz, Dimitri Papadimitriou

Proceedings of the International Conference on Control, 2014

2013

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

Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy

Networks, 2013

Stochastic binary problems with simple penalties for capacity constraints violations.

Bernard Fortz, Martine Labbé, François V. Louveaux, Michael Poss

Math. Program., 2013

Benders Decomposition for the Hop-Constrained Survivable Network Design Problem.

Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia, Michael Poss

INFORMS J. Comput., 2013

Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs.

Bernard Fortz, Martine Labbé, Alessia Violin

Electron. Notes Discret. Math., 2013

SI on computational methods for network optimization problems.

Bernard Fortz, Luis Eduardo Neves Gouveia

EURO J. Comput. Optim., 2013

2012

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty.

Aysegül Altin, Bernard Fortz, Hakan Ümit

Networks, 2012

2011

Editorial: Preface to the Special Issue.

Bernard Fortz, Luce Brotcorne

Networks, 2011

Efficient techniques and tools for intra-domain traffic engineering.

Bernard Fortz, Hakan Ümit

Int. Trans. Oper. Res., 2011

Applications of meta-heuristics to traffic engineering in IP networks.

Bernard Fortz

Int. Trans. Oper. Res., 2011

Improved Formulations for the Ring Spur Assignment Problem.

Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy

Proceedings of the Network Optimization - 5th International Conference, 2011

On the Hazmat Transport Network Design Problem.

Edoardo Amaldi, Maurizio Bruglieri, Bernard Fortz

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

Easy distributions for combinatorial optimization problems with probabilistic constraints.

Bernard Fortz, Michael Poss

Oper. Res. Lett., 2010

On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length.

Edoardo Amaldi, Bernard Fortz, Claudio Iuliano

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Optimization of OSPF Routing in IP Networks.

Andreas Bley, Bernard Fortz, Éric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michal Pióro, Artur Tomaszewski, Hakan Ümit

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.

Bernard Fortz, Michael Poss

Oper. Res. Lett., 2009

Intra-domain traffic engineering with shortest path routing protocols.

Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit

4OR, 2009

2006

Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut.

Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau

Math. Program., 2006

Polyhedral Approaches to the Design of Survivable Networks.

Bernard Fortz, Martine Labbé

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2004

Increasing Internet Capacity Using Local Search.

Bernard Fortz, Mikkel Thorup

Comput. Optim. Appl., 2004

Two-Connected Networks with Rings of Bounded Cardinality.

Bernard Fortz, Martine Labbé

Comput. Optim. Appl., 2004

2003

A tabu search algorithm for self-healing ring network design.

Bernard Fortz, Patrick Soriano, Christelle Wynants

Eur. J. Oper. Res., 2003

2002

Polyhedral results for two-connected networks with bounded rings.

Bernard Fortz, Martine Labbé

Math. Program., 2002

Optimizing OSPF/IS-IS weights in a changing world.

Bernard Fortz, Mikkel Thorup

IEEE J. Sel. Areas Commun., 2002

Traffic engineering with traditional IP routing protocols.

Bernard Fortz, Jennifer Rexford, Mikkel Thorup

IEEE Commun. Mag., 2002

2000

Solving the Two-Connected Network with Bounded Meshes Problem.

Bernard Fortz, Martine Labbé, Francesco Maffioli

Oper. Res., 2000

Internet Traffic Engineering by Optimizing OSPF Weights.

Bernard Fortz, Mikkel Thorup

Proceedings of the Proceedings IEEE INFOCOM 2000, 2000