Articles dans des revues avec comité de lecture (157)
89.
Labbé, M., Yaman, H., & Gourdin, E. (2005). A branch and cut algorithm for hub location problems with single assignment. Mathematical Programming, 102, 371-405.
90.
Labbé, M., Laporte, G., Rodriguez Martin, I., & Salazar Gonzales, J. J. (2005). Locating median cycles in networks. European Journal of Operational Research, 160, 457-470. doi:10.1016/j.ejor.2003.07.010
91.
Labbé, M., & Yaman, H. (2004). Projecting the flow variables for hub location problems. Networks (New York), 44(2), 84-93. doi:10.1002/net.20019
92.
Labbé, M., Laporte, G., Rodriguez Martin, I., & Salazar Gonzales, J. J. (2004). The ring star problem: Polyhedral analysis and exact algorithm. Networks (New York), 43(3), 177-189. doi:10.1002/net.10114
93.
Feremans, C., Labbé, M., & Laporte, G. (2004). The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm. Networks (New York), 43(2), 71-86. doi:10.1002/net.10105
94.
Hamacher, H., Labbé, M., Nickel, S., & Sonneborn, T. (2004). Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics, 145, 104-116. doi:10.1016/j.dam.2003.09.011
95.
Elloumi, S., Labbé, M., & Pochet, Y. (2004). New formulation and resolution method for the p-center problem. I N F O R M S Journal on Computing, 16, 84-94. doi:10.1287/ijoc.1030.0028
96.
Labbé, M., Rodriguez Martin, I., & Salazar Gonzales, J. J. (2004). A branch-and-cut algorithm for the plant-cycle location problem. Operational Research Society. Journal, 55, 513-520. doi:10.1057/palgrave.jors.2601692
97.
Fortz, B., & Labbé, M. (2004). Two-connected networks with rings of bounded cardinality. Computational Optimization and Applications, 27, 123-148.
98.
Labbé, M., Laporte, G., & Martello, S. (2003). Upper bounds and algorithms for the maximum cardinality bin packing problem. European Journal of Operational Research, 149, 490-498.
99.
Feremans, C., Labbé, M., & Laporte, G. (2003). Generalized network design problems. European Journal of Operational Research, 148, 1-13.
100.
Mladenovic, N., Labbé, M., & Hansen, P. (2003). Solving the p-center problem with tabu search and variable neighborhood search. Networks (New York), 42(1), 48-64. doi:10.1002/net.10081