Articles dans des revues avec comité de lecture (157)
  1. 41. Catanzaro, D., Labbé, M., & Pesenti, R. (2013). The balanced minimum evolution problem under uncertain data. Discrete applied mathematics, 161(13-14), 1789-1804. doi:10.1016/j.dam.2013.03.012
  2. 42. Castelli, L., Labbé, M., & Violin, A. (2013). A Network Pricing Formulation for the Revenue Maximization of European Air Navigation Service Providers. Transportation research. Part C, Emerging technologies, 33, doi:10.1016/j.trc.2012.04.013, 214-226. doi:10.1016/j.trc.2012.04.013
  3. 43. 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
  4. 44. 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
  5. 45. Labbé, M., & Violin, A. (2013). Bilevel programming and price setting problems. 4OR, 11(1), 01-30. doi:10.1007/s10288-012-0213-0
  6. 46. 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
  7. 47. 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
  8. 48. 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
  9. 49. 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
  10. 50. 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
  11. 51. 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
  12. 52. 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.
    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 >>