Bidding in day-ahead electricity markets: A dynamic programming framework - Jérôme De Boeck; Bernard Fortz; Martine Labbé; Étienne Marcotte; Patrice Marcotte; Gilles Savard (Comput. Oper. Res., 2025)

Leveraging duality for the gamma-robust segment routing traffic engineering problem - Hugo Callebaut; Jérôme De Boeck; Bernard Fortz (Discret. Appl. Math., 2025)

Fare inspection patrolling under in-station selective inspection policy - Pablo Escalona; Luce Brotcorne; Bernard Fortz; Mario Ramirez (Ann. Oper. Res., 2024)

Fill-rate service level constrained distribution network design - Pablo Escalona; Alejandro Angulo; Luce Brotcorne; Bernard Fortz; Paulina Tapia (Int. Trans. Oper. Res., 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; et al. (J. Oper. Res. Soc., 2024)

Min-max optimization of node-targeted attacks in service networks - Bernard Fortz; Mariusz Mycek; Michal Pióro; Artur Tomaszewski (Networks, 2024)

Loads scheduling for demand response in energy communities - Mariam Sangaré; Eric Bourreau; Bernard Fortz; Amaury Pachurka; Michael Poss (Comput. Oper. Res., 2023)

Preprocessing for segment routing optimization - Hugo Callebaut; Jérôme De Boeck; Bernard Fortz (Networks, 2023)

The Case for Stochastic Online Segment Routing under Demand Uncertainty - Jérôme De Boeck; Bernard Fortz; Stefan Schmid (IFIP Networking Conference, IFIP Networking 2023, Barcelona, Spain, June 12-15, 2023, 2023)

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)

Strategic bidding in price coupled regions - Jérôme De Boeck; Luce Brotcorne; Bernard Fortz (Math. Methods Oper. Res., 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)

Preface: Special issue on network analytics and optimization - Bernard Fortz; Luis Gouveia; Christina Büsing; Markus Leitner (Networks, 2021)

Special issue on bilevel optimization - Luce Brotcorne; Bernard Fortz; Martine Labbé (EURO J. Comput. Optim., 2020)

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)

A study of general and security Stackelberg game formulations - Carlos Casorrán; Bernard Fortz; Martine Labbé; Fernando Ordóñez (Eur. J. Oper. Res., 2019)

Operations Research Proceedings 2018, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Brussels, Belgium, September 12-14, 2018 - Bernard Fortz; Martine Labbé (Springer, 2019)

The 2 edge-disjoint 3-paths polyhedron - Quentin Botton; Bernard Fortz; Luis Gouveia (Ann. des Télécommunications, 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)

Extended formulation for hop constrained distribution network configuration problems - Jérôme De Boeck; Bernard Fortz (Eur. J. Oper. Res., 2018)

Preface: Recent advances in telecommunications networks planning and operation - Bernard Fortz; Dimitri Papadimitriou; Mauricio G. C. Resende (Networks, 2018)

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)

A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem - Bernard Fortz; Enrico Gorgone; Dimitri Papadimitriou (Networks, 2017)

Sub-hour Unit Commitment MILP Model with Benchmark Problem Instances - Paula Carroll; Damian Flynn; Bernard Fortz; Alex Melhorn (Computational Science and Its Applications - ICCSA 2017 - 17th International Conference, Trieste, Italy, July 3-6, 2017, Proceedings, Part II, 2017)

Location of stations in a one-way electric car sharing system - Hatice Calik; Bernard Fortz (2017 IEEE Symposium on Computers and Communications, ISCC 2017, Heraklion, Greece, July 3-6, 2017, 2017)

Editorial - Bernard Fortz; Luis Eduardo Neves Gouveia (EURO J. Comput. Optim., 2016)

Distributed Monitoring Problem - Dimitri Papadimitriou; Bernard Fortz (Electron. Notes Discret. Math., 2016)

On the convex piecewise linear unsplittable multicommodity flow problem - Bernard Fortz; Luis Eduardo Neves Gouveia; Martim Joyce-Moniz (12th International Conference on the Design of Reliable Communication Networks, DRCN 2016, Paris, France, March 15-17, 2016, 2016)

On the hop-constrained survivable network design problem with reliable edges - Quentin Botton; Bernard Fortz; Luis Eduardo Neves Gouveia (Comput. Oper. Res., 2015)

A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem - Dimitri Papadimitriou; Bernard Fortz (Networks, 2015)

Lagrangian relaxation for the time-dependent combined network design and routing problem - Dimitri Papadimitriou; Bernard Fortz; Enrico Gorgone (2015 IEEE International Conference on Communications, ICC 2015, London, United Kingdom, June 8-12, 2015, 2015)

Robust cooperative monitoring problem - Dimitri Papadimitriou; Bernard Fortz (7th International Workshop on Reliable Networks Design and Modeling, RNDM 2015, Munich, Germany, October 5-7, 2015, 2015)

Branch-and-cut strategies for a multi-period network design and routing problem - Bernard Fortz; Dimitri Papadimitriou (International Conference on Control, Decision and Information Technologies, CoDIT 2014, Metz, France, November 3-5, 2014, 2014)

Methods for time-dependent combined network design and routing optimization - Dimitri Papadimitriou; Bernard Fortz (IEEE Global Communications Conference, GLOBECOM 2014, Austin, TX, USA, December 8-12, 2014, 2014)

Time-dependent combined network design and routing optimization - Dimitri Papadimitriou; Bernard Fortz (IEEE International Conference on Communications, ICC 2014, Sydney, Australia, June 10-14, 2014, 2014)

Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol - Bernard Fortz; Luis Eduardo Neves Gouveia; Martim Moniz (Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers, 2014)

Intra-domain traffic engineering with shortest path routing protocols - Aysegül Altin; Bernard Fortz; Mikkel Thorup; Hakan Ümit (Ann. Oper. Res., 2013)

SI on computational methods for network optimization problems - Bernard Fortz; Luis Eduardo Neves Gouveia (EURO J. Comput. Optim., 2013)

Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs - Bernard Fortz; Martine Labbé; Alessia Violin (Electron. Notes Discret. Math., 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)

Stochastic binary problems with simple penalties for capacity constraints violations - Bernard Fortz; Martine Labbé; François V. Louveaux; Michael Poss (Math. Program., 2013)

A branch-and-cut algorithm for the ring spur assignment problem - Paula Carroll; Bernard Fortz; Martine Labbé; Seán McGarraghy (Networks, 2013)

Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty - Aysegül Altin; Bernard Fortz; Hakan Ümit (Networks, 2012)

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

Efficient techniques and tools for intra-domain traffic engineering - Bernard Fortz; Hakan Ümit (Int. Trans. Oper. Res., 2011)

Editorial: Preface to the Special Issue - Bernard Fortz; Luce Brotcorne (Networks, 2011)

Improved Formulations for the Ring Spur Assignment Problem - Paula Carroll; Bernard Fortz; Martine Labbé; Seán McGarraghy (Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, 2011)

On the Hazmat Transport Network Design Problem - Edoardo Amaldi; Maurizio Bruglieri; Bernard Fortz (Network Optimization - 5th International Conference, INOC 2011, Hamburg, Germany, June 13-16, 2011. Proceedings, 2011)

Editorial - Bernard Fortz; Luis Eduardo Neves Gouveia (Networks, 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 (9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts, 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 (Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks, 2010)

Intra-domain traffic engineering with shortest path routing protocols - Aysegül Altin; Bernard Fortz; Mikkel Thorup; Hakan Ümit (4OR, 2009)

An improved Benders decomposition applied to a multi-layer network design problem - Bernard Fortz; Michael Poss (Oper. Res. Lett., 2009)

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é (Handbook of Optimization in Telecommunications, 2006)

Two-Connected Networks with Rings of Bounded Cardinality - Bernard Fortz; Martine Labbé (Comput. Optim. Appl., 2004)

Increasing Internet Capacity Using Local Search - Bernard Fortz; Mikkel Thorup (Comput. Optim. Appl., 2004)

A tabu search algorithm for self-healing ring network design - Bernard Fortz; Patrick Soriano; Christelle Wynants (Eur. J. Oper. Res., 2003)

Traffic engineering with traditional IP routing protocols - Bernard Fortz; Jennifer Rexford; Mikkel Thorup (IEEE Commun. Mag., 2002)

Optimizing OSPF/IS-IS weights in a changing world - Bernard Fortz; Mikkel Thorup (IEEE J. Sel. Areas Commun., 2002)

Polyhedral results for two-connected networks with bounded rings - Bernard Fortz; Martine Labbé (Math. Program., 2002)

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 IEEE INFOCOM 2000, The Conference on Computer Communications, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Reaching the Promised Land of Communications, Tel Aviv, Israel, March 26-30, 2000, 2000)