Documents publiés en "2018"
Département de génie informatique et génie logiciel
Olivier, P., Lodi, A., & Pesant, G. (juin 2018). A comparison of optimization methods for multi-objective constrained bin packing problems [Communication écrite]. 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands. Lien externe
Département de mathématiques et de génie industriel
Aardal, K., Von Heymann, F., Lodi, A., Tramontani, A., & Wolsey, L. A. (2018). Lattice reformulations cuts. (Rapport technique n° DS4DM-2018-003). Non disponible
Abrignani, M. D., Giupponi, L., Lodi, A., & Verdone, R. (2018). Scheduling M2M traffic over LTE uplink of a dense small cell network. EURASIP Journal on Wireless Communications and Networking, 2018(1). Disponible
Bengio, Y., Lodi, A., & Prouvost, A. (2018). Machine learning for combinatorial optimization : a methodological tour d'horizon. (Rapport technique n° DS4DM-2018-08).
Bonami, P., Lodi, A., & Zarpellon, G. (juin 2018). Learning a classification of mixed-integer quadratic programming problems [Communication écrite]. 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands. Lien externe
Borzou, R., Desaulniers, G., Fausto, E., & Lodi, A. (2018). A PCA-based approximation scheme for combinatorial optimization with uncertain and correlated data. (Rapport technique n° DS4DM-2018-002).
Carvalho, M., Lodi, A., & Marcotte, P. (2018). A polynomial algorithm for a continuous bilevel knapsack problem. Operations Research Letters, 46(2), 185-188. Lien externe
Carvalho, M., Lodi, A., & Pedroso, J. P. (2018). Computing Nash equilibria for integer programming games. (Rapport technique n° G-2018-83). Lien externe
Fischetti, M., Lodi, A., & Zarpellon, G. (2018). Learning milp resolution outcomes before reaching time-limit. (Rapport technique n° DS4DM-2018-009).
Gambella, C., Lodi, A., & Vigo, D. (2018). Exact solutions for the carrier-vehicle traveling salesman problem. Transportation Science, 52(2), 320-330. Lien externe
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2018). Travel speed prediction based on learning methods for home delivery. (Rapport technique n° DS4DM-2018-012). Non disponible
Gmira, M., Gendreau, M., Lodi, A., & Potvin, J.-Y. (2018). Travel speed prediction based on learning methods for home delivery. (Rapport technique n° CIRRELT-2018-46). Lien externe
Lodi, A., & Moradi, A. (2018). Experiments on virtual private network design with concave capacity costs. Optimization Letters, 12(5), 945-957. Lien externe
Olivier, P., Lodi, A., & Pesant, G. (juin 2018). A comparison of optimization methods for multi-objective constrained bin packing problems [Communication écrite]. 15th International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2018), Delft, Netherlands. Lien externe
Rostami, B., Desaulniers, G., Errico, F., & Lodi, A. (2018). The vehicle routing problem with stochastic and correlated travel times. (Rapport technique n° DS4DM-2018-001).
Rostami, B., Desaulniers, G., Errico, F., & Lodi, A. (2018). A PCA-based approximation scheme for combinatorial optimization with uncertain and correlated data. (Rapport technique n° G-2018-61). Lien externe
Rostami, B., Errico, F., & Lodi, A. (2018). A convex reformulation and an outer approximation for a class of binary quadratic program. (Rapport technique n° DS4DM-2018-002).