 | Monter d'un niveau |
Cacchiani, V., Jünger, M., Liers, F., Lodi, A., & Schmidt, D. R. (2016). Single-commodity robust network design with finite and Hose demand sets. Mathematical Programming, 157(1), 297-342. Lien externe
Cacchiani, V., Jünger, M., Liers, F., Lodi, A., & Schmidt, D. R. (2015). Single-Commodity robust network design with finite and hose demand sets. (Rapport technique). Lien externe
Álvarez-Miranda, E., Cacchiani, V., Dorneth, T., Jünger, M., Liers, F., Lodi, A., Parriani, T., & Schmidt, D. R. (avril 2012). Models and algorithms for robust network design with several traffic scenarios [Communication écrite]. 2nd International Symposium on Combinatorial Optimization (ISCO 2012), Athens, Greece. Lien externe
Lodi, A. (2010). Mixed integer programming computation. Dans Jünger, M., Liebling, T. M., Naddef, D., Nemhauser, G. L., Pulleyblank, W. R., Reinelt, G., Rinaldi, G., & Wolsey, L. A. (édit.), 50 years of integer programming 1958-2008 (619-645). Lien externe
Fischetti, M., & Lodi, A. (juin 2005). Optimizing over the first Chvatal closure [Communication écrite]. 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany. Lien externe
Fischetti, M., Lodi, A., & Toth, P. (mars 2001). Solving real-world ATSP instances by branch-and-cut [Communication écrite]. 5th International Workshop on Combinatorial Optimization, Aussois, France. Lien externe
