Bernard Fortz

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 26

Top Topics

Benders Decomposition

Spanning Tree Protocol

Multicommodity Flow

Piecewise Linear

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Publications

Pablo Escalona, Alejandro Angulo, Luce Brotcorne, Bernard Fortz, Paulina Tapia
Fill-rate service level constrained distribution network design. Int. Trans. Oper. Res. 31 (1) (2024)
Pablo Escalona, Luce Brotcorne, Bernard Fortz, Mario Ramirez
Fare inspection patrolling under in-station selective inspection policy. Ann. Oper. Res. 332 (1) (2024)
Bernard Fortz, Mariusz Mycek, Michal Pióro, Artur Tomaszewski
Min-max optimization of node-targeted attacks in service networks. Networks 83 (2) (2024)
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
Operational Research: methods and applications. J. Oper. Res. Soc. 75 (3) (2024)
Hugo Callebaut, Jérôme De Boeck, Bernard Fortz
Preprocessing for segment routing optimization. Networks 82 (4) (2023)
Jérôme De Boeck, Bernard Fortz, Stefan Schmid
The Case for Stochastic Online Segment Routing under Demand Uncertainty. IFIP Networking (2023)
Mariam Sangaré, Eric Bourreau, Bernard Fortz, Amaury Pachurka, Michael Poss
Loads scheduling for demand response in energy communities. Comput. Oper. Res. 160 (2023)
Bernard Fortz, Luis Eduardo Neves Gouveia, Pedro Moura
A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. Networks 80 (2) (2022)
Jérôme De Boeck, Luce Brotcorne, Bernard Fortz
Strategic bidding in price coupled regions. Math. Methods Oper. Res. 95 (3) (2022)
Víctor Bucarey, Bernard Fortz, Natividad González-Blanco, Martine Labbé, Juan A. Mesa
Benders decomposition for network design covering problems. Comput. Oper. Res. 137 (2022)
Bernard Fortz, Luis Eduardo Neves Gouveia, Christina Büsing, Markus Leitner
Preface: Special issue on network analytics and optimization. Networks 77 (4) (2021)
Luce Brotcorne, Bernard Fortz, Martine Labbé
Special issue on bilevel optimization. EURO J. Comput. Optim. 8 (1) (2020)
Carlos Casorrán, Bernard Fortz, Martine Labbé, Fernando Ordóñez
A study of general and security Stackelberg game formulations. Eur. J. Oper. Res. 278 (3) (2019)
Luciano Porretta, Daniele Catanzaro, Bjarni V. Halldórsson, Bernard Fortz
A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs. 4OR 17 (1) (2019)
Jérôme De Boeck, Bernard Fortz
Extended formulation for hop constrained distribution network configuration problems. Eur. J. Oper. Res. 265 (2) (2018)
Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol. Discret. Appl. Math. 234 (2018)
Bernard Fortz, Dimitri Papadimitriou, Mauricio G. C. Resende
Preface: Recent advances in telecommunications networks planning and operation. Networks 71 (2) (2018)
Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia
The 2 edge-disjoint 3-paths polyhedron. Ann. des Télécommunications 73 (1-2) (2018)
Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz
Models for the piecewise linear unsplittable multicommodity flow problems. Eur. J. Oper. Res. 261 (1) (2017)
Bernard Fortz, Enrico Gorgone, Dimitri Papadimitriou
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem. Networks 69 (1) (2017)
Paula Carroll, Damian Flynn, Bernard Fortz, Alex Melhorn
Sub-hour Unit Commitment MILP Model with Benchmark Problem Instances. ICCSA (2) (2017)
Hatice Calik, Bernard Fortz
Location of stations in a one-way electric car sharing system. ISCC (2017)
Bernard Fortz, Olga Oliveira, Cristina Requejo
Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem. Eur. J. Oper. Res. 256 (1) (2017)
Bernard Fortz, Luis Eduardo Neves Gouveia
Editorial. EURO J. Comput. Optim. 4 (2) (2016)
Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz
On the convex piecewise linear unsplittable multicommodity flow problem. DRCN (2016)
Dimitri Papadimitriou, Bernard Fortz
Distributed Monitoring Problem. Electron. Notes Discret. Math. 52 (2016)
Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia
On the hop-constrained survivable network design problem with reliable edges. Comput. Oper. Res. 64 (2015)
Dimitri Papadimitriou, Bernard Fortz
A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem. Networks 66 (4) (2015)
Dimitri Papadimitriou, Bernard Fortz, Enrico Gorgone
Lagrangian relaxation for the time-dependent combined network design and routing problem. ICC (2015)
Dimitri Papadimitriou, Bernard Fortz
Robust cooperative monitoring problem. RNDM@WMNC (2015)
Dimitri Papadimitriou, Bernard Fortz
Time-dependent combined network design and routing optimization. ICC (2014)
Bernard Fortz, Dimitri Papadimitriou
Branch-and-cut strategies for a multi-period network design and routing problem. CoDIT (2014)
Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Moniz
Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol. ISCO (2014)
Dimitri Papadimitriou, Bernard Fortz
Methods for time-dependent combined network design and routing optimization. GLOBECOM (2014)
Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia, Michael Poss
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem. INFORMS J. Comput. 25 (1) (2013)
Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy
A branch-and-cut algorithm for the ring spur assignment problem. Networks 61 (2) (2013)
Bernard Fortz, Martine Labbé, François V. Louveaux, Michael Poss
Stochastic binary problems with simple penalties for capacity constraints violations. Math. Program. 138 (1-2) (2013)
Bernard Fortz, Luis Eduardo Neves Gouveia
SI on computational methods for network optimization problems. EURO J. Comput. Optim. 1 (3-4) (2013)
Bernard Fortz, Martine Labbé, Alessia Violin
Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs. Electron. Notes Discret. Math. 41 (2013)
Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit
Intra-domain traffic engineering with shortest path routing protocols. Ann. Oper. Res. 204 (1) (2013)
Aysegül Altin, Bernard Fortz, Hakan Ümit
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks 60 (2) (2012)
Bernard Fortz, Hakan Ümit
Efficient techniques and tools for intra-domain traffic engineering. Int. Trans. Oper. Res. 18 (3) (2011)
Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy
Improved Formulations for the Ring Spur Assignment Problem. INOC (2011)
Bernard Fortz, Luce Brotcorne
Editorial: Preface to the Special Issue. Networks 58 (2) (2011)
Bernard Fortz
Applications of meta-heuristics to traffic engineering in IP networks. Int. Trans. Oper. Res. 18 (2) (2011)
Edoardo Amaldi, Maurizio Bruglieri, Bernard Fortz
On the Hazmat Transport Network Design Problem. INOC (2011)
Edoardo Amaldi, Bernard Fortz, Claudio Iuliano
On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length. CTW (2010)
Bernard Fortz, Luis Eduardo Neves Gouveia
Editorial. Networks 55 (3) (2010)
Bernard Fortz, Michael Poss
Easy distributions for combinatorial optimization problems with probabilistic constraints. Oper. Res. Lett. 38 (6) (2010)
Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit
Intra-domain traffic engineering with shortest path routing protocols. 4OR 7 (4) (2009)
Bernard Fortz, Michael Poss
An improved Benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37 (5) (2009)
Bernard Fortz, Ali Ridha Mahjoub, S. Thomas McCormick, Pierre Pesneau
Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Math. Program. 105 (1) (2006)
Bernard Fortz, Martine Labbé
Two-Connected Networks with Rings of Bounded Cardinality. Comput. Optim. Appl. 27 (2) (2004)
Bernard Fortz, Mikkel Thorup
Increasing Internet Capacity Using Local Search. Comput. Optim. Appl. 29 (1) (2004)
Bernard Fortz, Patrick Soriano, Christelle Wynants
A tabu search algorithm for self-healing ring network design. Eur. J. Oper. Res. 151 (2) (2003)
Bernard Fortz, Mikkel Thorup
Optimizing OSPF/IS-IS weights in a changing world. IEEE J. Sel. Areas Commun. 20 (4) (2002)
Bernard Fortz, Martine Labbé
Polyhedral results for two-connected networks with bounded rings. Math. Program. 93 (1) (2002)
Bernard Fortz, Jennifer Rexford, Mikkel Thorup
Traffic engineering with traditional IP routing protocols. IEEE Commun. Mag. 40 (10) (2002)
Bernard Fortz, Martine Labbé, Francesco Maffioli
Solving the Two-Connected Network with Bounded Meshes Problem. Oper. Res. 48 (6) (2000)
Bernard Fortz, Mikkel Thorup
Internet Traffic Engineering by Optimizing OSPF Weights. INFOCOM (2000)