Articles dans des revues avec comité de lecture (46)
  1. 17. Carroll, P., Flynn, D., Fortz, B., & Melhorn, A. (2017). Sub-hour unit commitment MILP model with benchmark problem instances. Lecture notes in computer science, 10405, 635-651. doi:10.1007/978-3-319-62395-5_44
  2. 18. Fortz, B., Gouveia, L., & Barros 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
  3. 19. Papadimitriou, D., & Fortz, B. (2016). Distributed Monitoring Problem. Electronic Notes in Discrete Mathematics, 52, 13-20. doi:10.1016/j.endm.2016.03.003
  4. 20. Fortz, B., & Gouveia, L. (2016). Editorial. EURO Journal on Computational Optimization, 4(2), 123-124. doi:10.1007/s13675-016-0068-9
  5. 21. Papadimitriou, D., & Fortz, B. (2015). A Rolling Horizon Heuristic for the Multiperiod Network Design and Routing Problem. Networks, 66(4), 364-379. doi:10.1002/net.21659
  6. 22. Botton, Q. Q. B., Fortz, B., & Gouveia, L. (2015). On the hop-constrained survivable network design problem with reliable edges. Computers & operations research, 64, 159-167. doi:10.1016/j.cor.2015.05.009
  7. 23. Fortz, B., Gouveia, L., & Moniz, M. (2014). Mathematical programming models for traffic engineering in Ethernet networks implementing the multiple spanning tree protocol. Lecture notes in computer science, 8596 LNCS, 242-254. doi:10.1007/978-3-319-09174-7_21
  8. 24. Fortz, B., & Gouveia, L. (2013). SI on computational methods for network optimization problems. EURO Journal on Computational Optimization, 1(3-4), 219. doi:10.1007/s13675-013-0017-9
  9. 25. Fortz, B., Labbé, M., & Violin, A. (2013). Dantzig-Wolfe Reformulation for the Network Pricing Problem with Connected Toll Arcs. Electronic Notes in Discrete Mathematics, 41, 117-124. doi:10.1016/j.endm.2013.05.083
  10. 26. Altin, A., Fortz, B., Thorup, M., & Umit, H. (2013). Intra-domain traffic engineering with shortest path routing protocols. Annals of operation research, 204(1), 65-95. doi:10.1007/s10479-012-1270-7
  11. 27. 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
  12. 28. Carroll, P., Fortz, B., Labbé, M., & McGarraghy, S. (2013). A branch-and-cut algorithm for the ring spur assignment problem. Networks, 61(2), 89-103. doi:10.1002/net.21495
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 Suivant >>