Up a level |
This 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.
Archetti, C., Uchoa, E., & Vidal, T. (2024). Special Section on "DIMACS Implementation Challenge: Vehicle Routing" and "The EURO Meets NeurIPS 2022 Vehicle Routing Competition". Transportation Science, 58(4), 685-686. External link
Archetti, C., Desaulniers, G., & Speranza, M. G. (2017). Minimizing the logistic ratio in the inventory routing problem. EURO Journal on Transportation and Logistics, 6(4), 289-306. External link
Archetti, C., Bianchessi, N., Hertz, A., Colombet, A., & Gagnon, F. (2012, August). Directed weighted improper coloring for cellular channel allocation [Paper]. 8th International Colloquium on Graphs and Optimization (GO VIII), Leukerbad, Switzerland. Published in Discrete Applied Mathematics, 182(19). External link
Archetti, C., Bianchessi, N., & Hertz, A. (2014). A branch-and-price algorithm for the robust graph coloring problem. Discrete Applied Mathematics, 165, 49-59. External link
Archetti, C., Bianchessi, N., Speranza, M. G., & Hertz, A. (2014). Incomplete service and split deliveries in a routing problem with profits. Networks, 63(2), 135-145. External link
Lodi, A., Tubertini, P., Grilli, R., & Senese, F. (2014, May). Tactical versus operational discrete event simulation: a breast screening case study [Paper]. 28th European Conference on Modelling and Simulation (ECMS 2014), Brescia, Italy. External link
Cote, J.-F., Archetti, C., Speranza, M. G., Gendreau, M., & Potvin, J.-Y. (2012). A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks, 60(4), 212-226. External link
Archetti, C., Bertazzi, L., Hertz, A., & Speranza, M. G. (2012). A Hybrid Heuristic for an Inventory Routing Problem. INFORMS Journal on Computing, 24(1), 101-116. External link
Côté, J.-F., Archetti, C., Speranza, M. G., Gendreau, M., & Potvin, J.-Y. (2010). A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. (Technical Report n° CIRRELT-2010-55). External link
Archetti, C., Feillet, D., Hertz, A., & Speranza, M. G. (2010). The undirected capacitated arc routing problem with profits. Computers & Operations Research, 37(11), 1860-1869. External link