Monter d'un niveau |
Bostel, N., Castagliola, P., Dejax, P., & Langevin, A. (2017). Erratum: Approximating the length of Chinese postman tours. 4OR, 15(3), 329-330. Lien externe
Bostel, N., Castagliola, P., Dejax, P., & Langevin, A. (2014). Approximating the length of Chinese postman tours. 4or-a Quarterly Journal of Operations Research, 12(4), 359-372. Lien externe
Bostel, N., Dejax, P., Langevin, A., Pavageau, C., & Wizere, A. (juin 2023). Planification et optimisation de la gestion des déchets: Application au plan d'un Département français [Communication écrite]. 4e congrès international de génie industriel : L'innovation et le développement durable dans la production de biens et de services, Aix-Marseille, France. Non disponible
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2014). An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size. Computers and Operations Research, 43(1), 9-19. Lien externe
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2014). Solving the close-enough arc routing problem. Networks, 63(1), 107-118. Lien externe
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2013). An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. European Journal of Operational Research, 226(2), 211-220. Lien externe
Ha Minh, H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2012). An exact algorithm and a metaheuristic for the generalized vehicle routing problem. (Rapport technique n° CIRRELT-2012-73). Lien externe
Ha Minh, H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2012). An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. (Rapport technique n° CIRRELT-2012-64). Lien externe
Ha Minh, H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2012). Solving the close-enough arc routing problem. (Rapport technique n° CIRRELT-2012-72). Lien externe
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (février 2012). An exact algorithm for the close enough traveling salesman problem with arc covering constraints [Communication écrite]. 1st International Conference on Operations Research and Enterprise Systems (ICORES 2012), Vilamoura, Algarve, Portugal. Non disponible