Bernard Fortz

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