 | Monter d'un niveau |
Aardal, K., Lodi, A., Tramontani, A., von Heymann, F., & Wolsey, L. A. (2021). Lattice reformulation cuts. SIAM Journal on Optimization, 31(4), 2539-2557. Lien externe
Aardal, K., Von Heymann, F., Lodi, A., Tramontani, A., & Wolsey, L. A. (2018). Lattice reformulations cuts. (Rapport technique n° DS4DM-2018-003). Non disponible
Baggio, A., Carvalho, M., Lodi, A., & Tramontani, A. (2021). Multilevel Approaches for the Critical Node Problem. Operations Research, 69(2), 486-508. Lien externe
Bonami, P., Lodi, A., Schweiger, J., & Tramontani, A. (2019). Solving quadratic programming by cutting planes. SIAM Journal on Optimization, 29(2), 1076-1105. Lien externe
Bonami, P., Lodi, A., Tramontani, A., & Wiese, S. (juin 2017). Cutting planes from wide split disjunctions [Communication écrite]. 19th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2017), Waterloo, ON. Lien externe
Baggio, A., Carvalho, M., Lodi, A., & Tramontani, A. (2017). Multilevel approaches for the critical node problem. (Rapport technique n° DS4DM-2017-012). Lien externe
Bonami, P., Lodi, A., Tramontani, A., & Wiese, S. (2016). Cutting planes from wide spilt disjunctions. (Rapport technique n° DS4DM-2016-003). Lien externe
Bonami, P., Lodi, A., Schweiger, J., & Tramontani, A. (2016). Solving standard quadratic programming by cutting planes. (Rapport technique n° DS4DM-2016-001). Lien externe
Bonami, P., Lodi, A., Tramontani, A., & Wiese, S. (2015). On mathematical programming with indicator constraints. Mathematical Programming, 151(1), 191-223. Lien externe
Belotti, P., Liberti, L., Lodi, A., Nannicini, G., & Tramontani, A. (2011). Disjunctive inequalities: applications and extensions. Dans Wiley encyclopedia of operations research and management science . Lien externe
Dey, S. S., Lodi, A., Tramontani, A., & Wolsey, L. A. (2014). On the practical strength of two-row tableau cuts. INFORMS Journal on Computing, 26(2), 222-237. Lien externe
Dash, S., Gunluk, O., Lodi, A., & Tramontani, A. (2012). A time bucket formulation for the traveling salesman problem with time windows. INFORMS Journal on Computing, 24(1), 132-147. Lien externe
Dey, S. S., Lodi, A., Tramontani, A., & Wolsey, L. A. (juin 2010). Experiments with two row tableau cuts [Communication écrite]. 14th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2010), Lausanne, Suisse. Lien externe
Fischetti, M., Lodi, A., Monaci, M., Salvagnin, D., & Tramontani, A. (2016). Improving branch-and-cut performance by random sampling. Mathematical Programming Computation, 8(1), 113-132. Lien externe
Fischetti, M., Lodi, A., Monaci, M., Salvagnin, D., & Tramontani, A. (2013). Tree search stabilization by random sampling. (Rapport technique). Non disponible
Fischetti, M., Lodi, A., & Tramontani, A. (2011). On the separation of disjunctive cuts. Mathematical Programming, 128(1-2), 205-230. Lien externe
Lodi, A., & Tramontani, A. (2013). Performance variability in mixed-integer programming. Dans Topaloglu, H. (édit.), Theory driven by influential applications (1-12). Lien externe
Shen, R., Tang, B., Lodi, A., Tramontani, A., & Ayed, I. B. (2020). An ILP Model for Multi-Label MRFs with Connectivity Constraints. IEEE Transactions on Image Processing, 29, 6909-6917. Lien externe
Shen, R., Kendinibilir, E., Ben Ayed, I., Lodi, A., Tramontani, A., & Reinelt, G. (2017). An ILP solver for multi-label MRFs with connectivity constraints. (Rapport technique n° DS4DM-2017-016). Lien externe
