Articles dans des revues avec comité de lecture (165)
  1. 53. Labbé, M., & Violin, A. (2013). Bilevel programming and price setting problems. 4OR, 11(1), 01-30. doi:10.1007/s10288-012-0213-0
  2. 54. 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
  3. 55. Figueiredo, R., Frota, Y., & Labbé, M. (2013). Solution of the maximum k-balanced subgraph problem. Lecture notes in computer science, 7997 LNCS, 266-271. doi:10.1007/978-3-642-44973-4_28
  4. 56. Catanzaro, D., Labbé, M., Pesenti, R., & Salazar Gonzales, J. J. (2012). The balanced minimum evolution problem. INFORMS journal on computing, 24(2), 276-294. doi:10.1287/ijoc.1110.0455
  5. 57. Catanzaro, D., Labbé, M., & Halldórsson, B. B. (2012). A mixed integer programming model for the parsimonious loss of heterozygosity problem. Lecture notes in computer science, 7292 LNBI, 24-35. doi:10.1007/978-3-642-30191-9_3
  6. 58. Figueiredo, R., Labbé, M., & De Souza, C. C. (2011). An exact approach to the problem of extracting an embedded network matrix. Computers & operations research, 38(11), 1483-1492. doi:10.1016/j.cor.2011.01.003
  7. 59. Arbib, C., Servilio, M., & Labbé, M. (2011). Scheduling two chains of unit jobs on one machine: A polyhedral study. Networks, 58(2), 103-113. doi:10.1002/net.20452
  8. 60. García, S., Labbé, M., & Marin, A. (2011). Solving large p-median problems with a radius formulation. INFORMS journal on computing, 23(4), 546-556.
  9. 61. Heilporn, G., Labbé, M., Marcotte, P., & Savard, G. (2011). Valid inequalities and branch-and-cut for the clique pricing problem. Discrete Optimization, 8(3), 393-410. doi:10.1016/j.disopt.2011.01.001
  10. 62. Catanzaro, D., Labbé, M., & Salazar-Neumann, M. (2011). Reduction approaches for robust shortest path problems. Computers & operations research, 38(11), 1610-1619.
  11. 63. Catanzaro, D., Gourdin, E., Labbé, M., & Ozsoy, F. A. (2011). A branch-and-cut algorithm for the partitioning-hub location-routing problem. Computers & operations research, 38(2), 539-549. doi:10.1016/j.cor.2010.07.014
  12. 64. Catanzaro, D., Porretta'S, L., & Labbé, M. (2011). A Class Representative Model for Pure Parsimony Haplotyping under Uncertain Data. P L o S One, 6(3), e17937. doi:10.1371/journal.pone.0017937
    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 >>