default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernard Fortz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j46]Pablo Escalona
, Luce Brotcorne, Bernard Fortz, Mario Ramirez:
Fare inspection patrolling under in-station selective inspection policy. Ann. Oper. Res. 332(1): 191-212 (2024)- [j45]Pablo Escalona, Alejandro Angulo, Luce Brotcorne, Bernard Fortz, Paulina Tapia:
Fill-rate service level constrained distribution network design. Int. Trans. Oper. Res. 31(1): 5-28 (2024) - [j44]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): 423-617 (2024) - [j43]Bernard Fortz, Mariusz Mycek, Michal Pióro, Artur Tomaszewski:
Min-max optimization of node-targeted attacks in service networks. Networks 83(2): 256-288 (2024) - 2023
- [j42]Mariam Sangaré, Eric Bourreau, Bernard Fortz, Amaury Pachurka, Michael Poss:
Loads scheduling for demand response in energy communities. Comput. Oper. Res. 160: 106358 (2023) - [j41]Hugo Callebaut, Jérôme De Boeck, Bernard Fortz:
Preprocessing for segment routing optimization. Networks 82(4): 459-478 (2023) - [c14]Jérôme De Boeck, Bernard Fortz, Stefan Schmid:
The Case for Stochastic Online Segment Routing under Demand Uncertainty. IFIP Networking 2023: 1-8 - 2022
- [j40]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: 105417 (2022) - [j39]Jérôme De Boeck, Luce Brotcorne, Bernard Fortz:
Strategic bidding in price coupled regions. Math. Methods Oper. Res. 95(3): 365-407 (2022) - [j38]Bernard Fortz, Luis 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): 178-192 (2022) - 2021
- [j37]Bernard Fortz, Luis Gouveia, Christina Büsing, Markus Leitner:
Preface: Special issue on network analytics and optimization. Networks 77(4): 475-476 (2021) - 2020
- [j36]Luce Brotcorne, Bernard Fortz, Martine Labbé:
Special issue on bilevel optimization. EURO J. Comput. Optim. 8(1): 1-2 (2020)
2010 – 2019
- 2019
- [j35]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): 75-96 (2019) - [j34]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): 855-868 (2019) - [e1]Bernard Fortz, Martine Labbé:
Operations Research Proceedings 2018, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Brussels, Belgium, September 12-14, 2018. Springer 2019, ISBN 978-3-030-18499-5 [contents] - 2018
- [j33]Quentin Botton, Bernard Fortz, Luis Gouveia:
The 2 edge-disjoint 3-paths polyhedron. Ann. des Télécommunications 73(1-2): 29-36 (2018) - [j32]Bernard Fortz, Luís Gouveia, Martim Joyce-Moniz:
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol. Discret. Appl. Math. 234: 114-130 (2018) - [j31]Jérôme De Boeck, Bernard Fortz:
Extended formulation for hop constrained distribution network configuration problems. Eur. J. Oper. Res. 265(2): 488-502 (2018) - [j30]Bernard Fortz, Dimitri Papadimitriou, Mauricio G. C. Resende:
Preface: Recent advances in telecommunications networks planning and operation. Networks 71(2): 95-96 (2018) - 2017
- [j29]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): 242-251 (2017) - [j28]Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz:
Models for the piecewise linear unsplittable multicommodity flow problems. Eur. J. Oper. Res. 261(1): 30-42 (2017) - [j27]Bernard Fortz, Enrico Gorgone, Dimitri Papadimitriou:
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem. Networks 69(1): 110-123 (2017) - [c13]Paula Carroll, Damian Flynn, Bernard Fortz, Alex Melhorn:
Sub-hour Unit Commitment MILP Model with Benchmark Problem Instances. ICCSA (2) 2017: 635-651 - [c12]Hatice Calik, Bernard Fortz:
Location of stations in a one-way electric car sharing system. ISCC 2017: 134-139 - 2016
- [j26]Bernard Fortz, Luis Eduardo Neves Gouveia:
Editorial. EURO J. Comput. Optim. 4(2): 123-124 (2016) - [j25]Dimitri Papadimitriou, Bernard Fortz:
Distributed Monitoring Problem. Electron. Notes Discret. Math. 52: 13-20 (2016) - [c11]Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz:
On the convex piecewise linear unsplittable multicommodity flow problem. DRCN 2016: 9-13 - 2015
- [j24]Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia:
On the hop-constrained survivable network design problem with reliable edges. Comput. Oper. Res. 64: 159-167 (2015) - [j23]Dimitri Papadimitriou, Bernard Fortz:
A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem. Networks 66(4): 364-379 (2015) - [c10]Dimitri Papadimitriou, Bernard Fortz, Enrico Gorgone:
Lagrangian relaxation for the time-dependent combined network design and routing problem. ICC 2015: 6030-6036 - [c9]Dimitri Papadimitriou, Bernard Fortz:
Robust cooperative monitoring problem. RNDM@WMNC 2015: 186-193 - 2014
- [c8]Bernard Fortz, Dimitri Papadimitriou:
Branch-and-cut strategies for a multi-period network design and routing problem. CoDIT 2014: 128-133 - [c7]Dimitri Papadimitriou, Bernard Fortz:
Methods for time-dependent combined network design and routing optimization. GLOBECOM 2014: 1303-1309 - [c6]Dimitri Papadimitriou, Bernard Fortz:
Time-dependent combined network design and routing optimization. ICC 2014: 1124-1130 - [c5]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: 242-254 - 2013
- [j22]Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit:
Intra-domain traffic engineering with shortest path routing protocols. Ann. Oper. Res. 204(1): 65-95 (2013) - [j21]Bernard Fortz, Luis Eduardo Neves Gouveia:
SI on computational methods for network optimization problems. EURO J. Comput. Optim. 1(3-4): 219 (2013) - [j20]Bernard Fortz, Martine Labbé, Alessia Violin:
Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs. Electron. Notes Discret. Math. 41: 117-124 (2013) - [j19]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): 13-26 (2013) - [j18]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): 199-221 (2013) - [j17]Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy:
A branch-and-cut algorithm for the ring spur assignment problem. Networks 61(2): 89-103 (2013) - 2012
- [j16]Aysegül Altin, Bernard Fortz, Hakan Ümit:
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks 60(2): 132-139 (2012) - 2011
- [j15]Bernard Fortz:
Applications of meta-heuristics to traffic engineering in IP networks. Int. Trans. Oper. Res. 18(2): 131-147 (2011) - [j14]Bernard Fortz, Hakan Ümit:
Efficient techniques and tools for intra-domain traffic engineering. Int. Trans. Oper. Res. 18(3): 359-376 (2011) - [j13]Bernard Fortz, Luce Brotcorne:
Editorial: Preface to the Special Issue. Networks 58(2): 81-82 (2011) - [c4]Paula Carroll, Bernard Fortz, Martine Labbé, Seán McGarraghy:
Improved Formulations for the Ring Spur Assignment Problem. INOC 2011: 24-36 - [c3]Edoardo Amaldi, Maurizio Bruglieri, Bernard Fortz:
On the Hazmat Transport Network Design Problem. INOC 2011: 327-338 - 2010
- [j12]Bernard Fortz, Luis Eduardo Neves Gouveia:
Editorial. Networks 55(3): 169-170 (2010) - [j11]Bernard Fortz, Michael Poss:
Easy distributions for combinatorial optimization problems with probabilistic constraints. Oper. Res. Lett. 38(6): 545-549 (2010) - [c2]Edoardo Amaldi, Bernard Fortz, Claudio Iuliano:
On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length. CTW 2010: 5-8 - [p2]Andreas Bley, Bernard Fortz, Éric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michal Pióro, Artur Tomaszewski, Hakan Ümit:
Optimization of OSPF Routing in IP Networks. Graphs and Algorithms in Communication Networks 2010: 199-240
2000 – 2009
- 2009
- [j10]Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit:
Intra-domain traffic engineering with shortest path routing protocols. 4OR 7(4): 301-335 (2009) - [j9]Bernard Fortz, Michael Poss:
An improved Benders decomposition applied to a multi-layer network design problem. Oper. Res. Lett. 37(5): 359-364 (2009) - 2006
- [j8]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): 85-111 (2006) - [p1]Bernard Fortz, Martine Labbé:
Polyhedral Approaches to the Design of Survivable Networks. Handbook of Optimization in Telecommunications 2006: 367-389 - 2004
- [j7]Bernard Fortz, Martine Labbé:
Two-Connected Networks with Rings of Bounded Cardinality. Comput. Optim. Appl. 27(2): 123-148 (2004) - [j6]Bernard Fortz, Mikkel Thorup:
Increasing Internet Capacity Using Local Search. Comput. Optim. Appl. 29(1): 13-48 (2004) - 2003
- [j5]Bernard Fortz, Patrick Soriano, Christelle Wynants:
A tabu search algorithm for self-healing ring network design. Eur. J. Oper. Res. 151(2): 280-295 (2003) - 2002
- [j4]Bernard Fortz, Jennifer Rexford, Mikkel Thorup:
Traffic engineering with traditional IP routing protocols. IEEE Commun. Mag. 40(10): 118-124 (2002) - [j3]Bernard Fortz, Mikkel Thorup:
Optimizing OSPF/IS-IS weights in a changing world. IEEE J. Sel. Areas Commun. 20(4): 756-767 (2002) - [j2]Bernard Fortz, Martine Labbé:
Polyhedral results for two-connected networks with bounded rings. Math. Program. 93(1): 27-54 (2002) - 2000
- [j1]Bernard Fortz, Martine Labbé, Francesco Maffioli:
Solving the Two-Connected Network with Bounded Meshes Problem. Oper. Res. 48(6): 866-877 (2000) - [c1]Bernard Fortz, Mikkel Thorup:
Internet Traffic Engineering by Optimizing OSPF Weights. INFOCOM 2000: 519-528
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
