The University of Liège wishes to use cookies or trackers to store and access your personal data, to perform audience measurement. Some cookies are necessary for the website to function. Cookie policy.
  | Callebaut, H., De Boeck, J., & Fortz, B. (31 March 2025). Leveraging duality for the gamma-robust segment routing traffic engineering problem. Discrete Applied Mathematics, 364, 199 - 212. doi:10.1016/j.dam.2024.12.021  Peer Reviewed verified by ORBi |
 | De Boeck, J., Fortz, B., Labbé, M., Marcotte, É., Marcotte, P., & Savard, G. (2025). Bidding in day-ahead electricity markets: A dynamic programming framework. Computers and Operations Research, 179, 107024. doi:10.1016/j.cor.2025.107024 Peer Reviewed verified by ORBi |
Fortz, B. (10 October 2024). Robust optimization for the Segment Routing Traffic Engineering Problem [Paper presentation]. Treizième journée thématique du groupe de travail "Optimisation dans les réseaux" du GDR-ROD. |
Aguayo, C., & Fortz, B. (July 2024). Unit Commitment problem with uncertain demand and renewable energy availability [Paper presentation]. 33rd European Conference on Operational Research (EURO 2024), Copenhague, Denmark. Editorial reviewed |
Fortz, B., Callebaut, H., & De Boeck, J. (July 2024). Robust optimization for the Segment Routing Traffic Engineering Problem [Paper presentation]. 25th International Symposium on Mathematical Programming (ISMP2024), Montréal, Canada. Editorial reviewed |
 | Fortz, B., Mycek, M., Pióro, M., & Tomaszewski, A. (March 2024). Min–max optimization of node‐targeted attacks in service networks. Networks, 83 (2), 256-288. doi:10.1002/net.22191 Peer Reviewed verified by ORBi |
 | Escalona, P., Brotcorne, L., Fortz, B., & Ramirez, M. (2024). Fare inspection patrolling under in-station selective inspection policy. Annals of Operations Research, 191–212. doi:10.1007/s10479-023-05670-2 Peer Reviewed verified by ORBi |
 | Escalona, P., Angulo, A., Brotcorne, L., Fortz, B., & Tapia, P. (January 2024). Fill-rate service level constrained distribution network design. International Transactions in Operational Research, 31 (1), 5-28. doi:10.1111/itor.13331 Peer Reviewed verified by ORBi |
Callebaut, H., De Boeck, J., & Fortz, B. (2024). Robust optimization for the Segment Routing Traffic Engineering Problem [Paper presentation]. International Network Optimization Conference (INOC) 2024, Dublin, Ireland. Peer reviewed |
Fortz, B., & Stiepen, A. (2024). Des mathématiques appliquées dans la gestion et l’optimisation. Liège, Belgium: HEC Liège. |
 | Petropoulos, F., Laporte, G., Aktas, E., Alumur, S. A., Archetti, C., Ayhan, H., Battarra, M., Bennell, J. A., Bourjolly, J.-M., Boylan, J. E., Breton, M., Canca, D., Charlin, L., Chen, B., Cicek, C. T., Cox, L. A., Currie, C. S. M., Demeulemeester, E., Ding, L., ... Zhao, X. (2024). Operational Research: methods and applications. Journal of the Operational Research Society, 75 (3), 423-617. doi:10.1080/01605682.2023.2253852 Peer Reviewed verified by ORBi |
 | Fortz, B., Gendron, B., & Gouveia, L. (2024). Models for Network Flow and Network Design Problems with Piecewise Linear Costs. In International Series in Operations Research and Management Science (pp. 149–161). Springer. doi:10.1007/978-3-031-57603-4_7 Editorial reviewed |
 | Smith, A. E., Vera, J. R., & Fortz, B. (Eds.). (2023). Proceedings of the 23rd International Conference of the International Federation of Operational Research Societies. International Federation of Operational Research Societies. doi:10.1287/ifors.2023 |
 | De Boeck, J., Fortz, B., & Schmid, S. (2023). The Case for Stochastic Online Segment Routing under Demand Uncertainty. In 2023 IFIP Networking Conference (IFIP Networking). United States: IEEE. doi:10.23919/IFIPNetworking57963.2023.10186361 Peer reviewed |
 | Sangaré, M., Bourreau, E., Fortz, B., Pachurka, A., & Poss, M. (2023). Loads scheduling for demand response in energy communities. Computers and Operations Research, 160. doi:10.1016/j.cor.2023.106358 Peer Reviewed verified by ORBi |
 | Callebaut, H., De Boeck, J., & Fortz, B. (2023). Preprocessing for segment routing optimization. Networks, 82 (4), 459-478. doi:10.1002/net.22165 Peer Reviewed verified by ORBi |
 | De Boeck, J., Brotcorne, L., & Fortz, B. (2022). Strategic bidding in price coupled regions. Mathematical Methods of Operations Research, 95 (3), 365-407. doi:10.1007/s00186-021-00768-4 Peer Reviewed verified by ORBi |
 | Laurent, A., Brotcorne, L., & Fortz, B. (2022). Transaction fees optimization in the Ethereum blockchain. Blockchain: Research and Applications, 3 (3). doi:10.1016/j.bcra.2022.100074 Peer reviewed |
 | Bucarey, V., Fortz, B., González-Blanco, N., Labbé, M., & Mesa, J. A. (2022). Benders decomposition for network design covering problems. Computers and Operations Research, 137. doi:10.1016/j.cor.2021.105417 Peer Reviewed verified by ORBi |
 | Fortz, B., Gouveia, L., & Moura, P. (2022). A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. Networks, 80 (2), 178-192. doi:10.1002/net.22086 Peer Reviewed verified by ORBi |
 | Fortz, B. (2021). Topology-Constrained Network Design. In T. G. Crainic, M. Gendreau, ... B. Gendron, Network design with applications to transportation and logistics (pp. 187-208). Springer Cham. doi:10.1007/978-3-030-64018-7_7 Editorial reviewed |
 | Brotcorne, L., Escalona, P., Fortz, B., & Labbé, M. (2021). Fare inspection patrols scheduling in transit systems using a Stackelberg game approach. Transportation Research. Part B, Methodological, 154, 1-20. doi:10.1016/j.trb.2021.10.001 Peer Reviewed verified by ORBi |
 | Porretta, L., Catanzaro, D., Halldórsson, B. V., & Fortz, B. (2019). A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs. 4OR: A Quarterly Journal of Operations Research, 17 (1), 75-96. doi:10.1007/s10288-018-0377-3 Peer Reviewed verified by ORBi |
 | Casorrán, C., Fortz, B., Labbé, M., & Ordóñez, F. (2019). A study of general and security Stackelberg game formulations. European Journal of Operational Research, 278 (3), 855-868. doi:10.1016/j.ejor.2019.05.012 Peer Reviewed verified by ORBi |
 | Çalık, H., & Fortz, B. (2019). A Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty. Transportation Research. Part B, Methodological, 125, 121-150. doi:10.1016/j.trb.2019.05.004 Peer Reviewed verified by ORBi |
 | Botton, Q., Fortz, B., & Gouveia, L. (2018). The 2 edge-disjoint 3-paths polyhedron. Annals of Telecommunications, 73 (1-2), 29-36. doi:10.1007/s12243-017-0615-2 Peer Reviewed verified by ORBi |
 | De Boeck, J., & Fortz, B. (2018). Extended formulation for hop constrained distribution network configuration problems. European Journal of Operational Research, 265 (2), 488-502. doi:10.1016/j.ejor.2017.08.017 Peer Reviewed verified by ORBi |
 | Carroll, P., Flynn, D., Fortz, B., & Melhorn, A. (2017). Sub-hour unit commitment MILP model with benchmark problem instances. In Computational Science and Its Applications – ICCSA 2017. Cham, Unknown/unspecified: Springer International Publishing. doi:10.1007/978-3-319-62395-5_44 Peer reviewed |
 | Fortz, B., Oliveira, O., & Requejo, C. (2017). Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem. European Journal of Operational Research, 256 (1), 242-251. doi:10.1016/j.ejor.2016.06.014 Peer Reviewed verified by ORBi |
 | Fortz, B., Gorgone, E., & Papadimitriou, D. (2017). A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem. Networks, 69 (1), 110-123. doi:10.1002/net.21721 Peer Reviewed verified by ORBi |
 | Fortz, B., Gouveia, L., & Joyce-Moniz, M. (2017). Models for the piecewise linear unsplittable multicommodity flow problems. European Journal of Operational Research, 261 (1), 30-42. doi:10.1016/j.ejor.2017.01.051 Peer Reviewed verified by ORBi |
 | Botton, Q., Fortz, B., & Gouveia, L. (2015). On the hop-constrained survivable network design problem with reliable edges. Computers and Operations Research, 64, 159-167. doi:10.1016/j.cor.2015.05.009 Peer Reviewed verified by ORBi |
 | Fortz, B., Labbé, M., Louveaux, F., & Poss, M. (2013). Stochastic binary problems with simple penalties for capacity constraints violations. Mathematical Programming, 138 (1-2), 199-221. doi:10.1007/s10107-012-0520-4 Peer Reviewed verified by ORBi |
 | Botton, Q., Fortz, B., Gouveia, L., & Poss, M. (2013). Benders decomposition for the hop-constrained survivable network design problem. INFORMS Journal on Computing, 25 (1), 13-26. doi:10.1287/ijoc.1110.0472 Peer Reviewed verified by ORBi |
 | Fortz, B. (2011). Applications of meta-heuristics to traffic engineering in IP networks. International Transactions in Operational Research, 18 (2), 131-147. doi:10.1111/j.1475-3995.2010.00776.x Peer Reviewed verified by ORBi |
 | Fortz, B., & Poss, M. (2010). Easy distributions for combinatorial optimization problems with probabilistic constraints. Operations Research Letters, 38 (6), 545-549. doi:10.1016/j.orl.2010.09.005 Peer Reviewed verified by ORBi |
 | Fortz, B., & Poss, M. (2009). An improved Benders decomposition applied to a multi-layer network design problem. Operations Research Letters, 37 (5), 359-364. doi:10.1016/j.orl.2009.05.007 Peer Reviewed verified by ORBi |
 | Fortz, B., Mahjoub, A. R., McCormick, S. T., & Pesneau, P. (2006). Two-edge connected subgraphs with bounded rings: Polyhedral results and Branch-and-Cut. Mathematical Programming, 105 (1), 85-111. doi:10.1007/s10107-005-0576-5 Peer Reviewed verified by ORBi |
 | Fortz, B., & Thorup, M. (2004). Increasing internet capacity using local search. Computational Optimization and Applications, 29 (1), 13-48. doi:10.1023/B:COAP.0000039487.35027.02 Peer Reviewed verified by ORBi |
 | Fortz, B., & Labbé, M. (2004). Two-Connected Networks with Rings of Bounded Cardinality. Computational Optimization and Applications, 27 (2), 123-148. doi:10.1023/B:COAP.0000008649.61438.6b Peer Reviewed verified by ORBi |
 | Fortz, B., Soriano, P., & Wynants, C. (2003). A tabu search algorithm for self-healing ring network design. European Journal of Operational Research, 151 (2), 280-295. doi:10.1016/S0377-2217(02)00826-3 Peer Reviewed verified by ORBi |
 | Fortz, B., & Labbé, M. (2002). Polyhedral results for two-connected networks with bounded rings. Mathematical Programming, 93 (1), 27-54. doi:10.1007/s10107-002-0299-9 Peer Reviewed verified by ORBi |
 | Fortz, B., & Thorup, M. (2002). Optimizing OSPF/IS-IS weights in a changing world. IEEE Journal on Selected Areas In Communications, 20 (4), 756-767. doi:10.1109/JSAC.2002.1003042 Peer Reviewed verified by ORBi |
 | Fortz, B., Rexford, J., & Thorup, M. (2002). Traffic engineering with traditional IP routing protocols. IEEE Communications Magazine, 40 (10), 118-124. doi:10.1109/MCOM.2002.1039866 Peer Reviewed verified by ORBi |
 | Fortz, B., Labbé, M., & Maffioli, F. (2000). Solving the two-connected network with bounded meshes problem. Operations Research, 48 (6), 866-877. doi:10.1287/opre.48.6.866.12390 Peer Reviewed verified by ORBi |
 | Fortz, B., & Thorup, M. (2000). Internet traffic engineering by optimizing OSPF weights. In Proceedings IEEE INFOCOM 2000. conference on computer communications. IEEE. Peer reviewed |
