<  Retour au portail Polytechnique Montréal

Documents dont l'auteur est "Archetti, Claudia"

Monter d'un niveau
Pour citer ou exporter [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Grouper par: Auteurs ou autrices | Date de publication | Sous-type de document | Aucun groupement
Aller à : 2024 | 2017 | 2015 | 2014 | 2012 | 2010
Nombre de documents: 10

2024

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. Lien externe

2017

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. Lien externe

2015

Archetti, C., Bianchessi, N., Hertz, A., Colombet, A., & Gagnon, F. (août 2012). Directed weighted improper coloring for cellular channel allocation [Communication écrite]. 8th International Colloquium on Graphs and Optimization (GO VIII), Leukerbad, Switzerland. Publié dans Discrete Applied Mathematics, 182(19). Lien externe

2014

Archetti, C., Bianchessi, N., & Hertz, A. (2014). A branch-and-price algorithm for the robust graph coloring problem. Discrete Applied Mathematics, 165, 49-59. Lien externe

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. Lien externe

Lodi, A., Tubertini, P., Grilli, R., & Senese, F. (mai 2014). Tactical versus operational discrete event simulation: a breast screening case study [Communication écrite]. 28th European Conference on Modelling and Simulation (ECMS 2014), Brescia, Italy. Lien externe

2012

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. Lien externe

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. Lien externe

2010

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. (Rapport technique n° CIRRELT-2010-55). Lien externe

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. Lien externe

Liste produite: Mon Nov 18 05:07:35 2024 EST.