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 |
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 |
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 |
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 |
Callebaut, H., De Boeck, J., & Fortz, B. (2023). Preprocessing for segment routing optimization. Networks, 82 (4), 459-478. doi:10.1002/net.22165 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
Ç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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
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 |
Fortz, B., & Thorup, M. (2000). Internet traffic engineering by optimizing OSPF weights. In Proceedings IEEE INFOCOM 2000. conference on computer communications. IEEE. |