![]() | Monter d'un niveau |
Hertz, A., Montagné, R., & Gagnon, F. (2019). A comparison of integer programming models for the partial directed weighted improper coloring problem. Discrete Applied Mathematics, 261, 229-245. Lien externe
Montagné, R., Gamache, M., & Gendreau, M. (2019). A shortest path-based algorithm for the inventory routing problem of waste vegetable oil collection. Journal of the Operational Research Society, 70(6), 986-997. Lien externe
Montagné, R., Hertz, A., & Gagnon, F. (2017). A multi-cell graph based dynamic resource allocation scheme for multi-user wireless networks. AEU - International Journal of Electronics and Communications, 76, 60-70. Lien externe
Hertz, A., Montagné, R., & Gagnon, F. (2017). Online algorithms for the maximum k-colorable subgraph problem. Computers & Operations Research, 91, 209-224. Lien externe
Hertz, A., Montagné, R., & Gagnon, F. (2016). Constructive algorithms for the partial directed weighted improper coloring problem. Journal of Graph Algorithms and Applications, 20(2), 159-188. Lien externe
Montagné, R. (2016). Optimisation de l'allocation de ressources dans un réseau de télécommunications par coloration impropre de graphes [Thèse de doctorat, École Polytechnique de Montréal]. Disponible