 | Up a level |
Collaboration networkThis graph maps the connections between all the collaborators of {}'s publications listed on this page.
Each link represents a collaboration on the same publication. The thickness of the link represents the number of collaborations.
Use the mouse wheel or scroll gestures to zoom into the graph.
You can click on the nodes and links to highlight them and move the nodes by dragging them.
Hold down the "Ctrl" key or the "⌘" key while clicking on the nodes to open the list of this person's publications.
Bostel, N., Castagliola, P., Dejax, P., & Langevin, A. (2017). Erratum: Approximating the length of Chinese postman tours. 4OR, 15(3), 329-330. External link
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. External link
Bostel, N., Dejax, P., Langevin, A., Pavageau, C., & Wizere, A. (2023, June). Planification et optimisation de la gestion des déchets: Application au plan d'un Département français [Paper]. 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. Unavailable
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. External link
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2014). Solving the close-enough arc routing problem. Networks, 63(1), 107-118. External link
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. External link
Ha Minh, H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2012). An exact algorithm and a metaheuristic for the generalized vehicle routing problem. (Technical Report n° CIRRELT-2012-73). External link
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. (Technical Report n° CIRRELT-2012-64). External link
Ha Minh, H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2012). Solving the close-enough arc routing problem. (Technical Report n° CIRRELT-2012-72). External link
Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2012, February). An exact algorithm for the close enough traveling salesman problem with arc covering constraints [Paper]. 1st International Conference on Operations Research and Enterprise Systems (ICORES 2012), Vilamoura, Algarve, Portugal. Unavailable
