Articles dans des revues avec comité de lecture (157)
  1. 77. Labbé, M., & Yaman, H. (2008). Solving the hub location problem in a star-star network. Networks, 51, 19-33.
  2. 78. Christophe, J., Dewez, S., Doignon, J.-P., Elloumi, S., Fasbender, G., Grégoire, P., Huygens, D., Labbé, M., Melot, H., & Yaman, H. (2008). Linear inequalities among graph invariants using Graphedron to uncover optimal relationships. Networks, 52, 287-298.
  3. 79. Cánovas, L., García, S., Marin, A., & Labbé, M. (2007). A strengthened formulation for the simple plant location problem with order. Operations research letters, 35(2), 141-150. doi:10.1016/j.orl.2006.01.012
  4. 80. Huygens, D., Labbé, M., Mahjoub, A. R., & Pesneau, P. (2007). The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut. Networks, 49(1), 116-133. doi:10.1002/net.20146
  5. 81. Belotti, P., Labbé, M., Maffioli, F., & Ndiaye, M. N. (2007). A branch-and-cut method for obnoxious p-median problem. 4 O R, 5, 299-314.
  6. 82. Cánovas, L., García, S., Labbé, M., & Marin, A. (2007). A strengthened formulation for the simple plant location with order. Operations Research Letters, 35, 141-150.
  7. 83. Huygens, D., Labbé, M., Mahjoub, A. R., & Pesneau, P. (2007). The two-edge connected hop-constrained network design problem: valid inequalities and branch & cut. Networks, 49, 116-133.
  8. 84. Labbé, M., Paixao, J., & Speranza, M. G. (2006). Annals of Operations Research: Preface. Annals of operation research, 144(1), 1. doi:10.1007/s10479-006-0018-7
  9. 85. Labbé, M., Marcotte, P., Savard, G., & Heilporn, G. (2006). New formulations and valid inequalities for the toll setting problem. IFAC proceedings volumes, 12(PART 1).
  10. 86. Labbé, M., Paixao, J., & Speranza, M. G. (2006). Optimization in Transportation. Annals of operation research, 144.
  11. 87. Labbé, M., & Yaman, H. (2006). Polyhedral analysis for concentrator location problems. Computational Optimization and Applications, 34, 377-408.
  12. 88. Cardinal, J., Labbé, M., Langerman, S., Levy, E., & Melot, H. (2005). A tight analysis of the maximal matching heuristic. Lecture notes in computer science, 3595, 701-709.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 Suivant >>