Articles dans des revues avec comité de lecture (46)
  1. 29. Botton, Q. Q. B., Fortz, B., Gouveia, L., & Poss, M. (2013). Benders Decomposition for the Hop-Constrained Survivable Network Design Problem. INFORMS journal on computing. doi:10.1287/ijoc.1110.0472
  2. 30. Altin, A., Fortz, B., & Umit, H. (2012). Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks (New York), 60(2), 132-139. doi:10.1002/net.21461
  3. 31. Fortz, B., & Umit, H. (2011). Efficient techniques and tools for intra-domain traffic engineering. International transactions in operational research, 18(3), 359-376. doi:10.1111/j.1475-3995.2010.00769.x
  4. 32. 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
  5. 33. Carroll, P., McGarraghy, S., Fortz, B., & Labbé, M. (2011). Improved formulations for the ring spur assignment problem. Lecture notes in computer science, 6701 LNCS, 24-36. doi:10.1007/978-3-642-21527-8_4
  6. 34. Amaldi, E., Bruglieri, M., & Fortz, B. (2011). On the hazmat transport network design problem. Lecture notes in computer science, 6701 LNCS, 327-338. doi:10.1007/978-3-642-21527-8_38
  7. 35. Fortz, B., & Poss, M. (2010). Easy distributions for combinatorial optimization problems with probabilistic constraints. Operations research letters, 38, 545-549. doi:10.1016/j.orl.2010.09.005
  8. 36. Altin, A., Fortz, B., Thorup, M., & Umit, H. (2009). Intra-domain traffic engineering with shortest path routing protocols. 4OR, 7(4), 301-335. doi:10.1007/s10288-009-0113-0
  9. 37. Poss, M., & Fortz, B. (2009). An improved benders decomposition applied to a multi-layer network design problem. Operations research letters, 37, 359-364. doi:10.1016/j.orl.2009.05.007
  10. 38. Fortz, B., Mahjoub, A. R., Mc Cormick, 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
  11. 39. 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
  12. 40. Fortz, B., & Labbé, M. (2004). Two-connected networks with rings of bounded cardinality. Computational Optimization and Applications, 27, 123-148.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 Suivant >>