![]() | Monter d'un niveau |
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
Belotti, P., Bonami, P., Fischetti, M., Lodi, A., Monaci, M., Nogales-Gomez, A., & Salvagnin, D. (2016). On handling indicator constraints in mixed integer programming. Computational Optimization and Applications, 65(3), 545-566. Lien externe
Fischetti, M., Lodi, A., & Tramontani, A. (2011). On the separation of disjunctive cuts. Mathematical Programming, 128(1-2), 205-230. Lien externe
Fischetti, M., & Lodi, A. (2010). On the knapsack closure of 0-1 integer linear programs. Electronic Notes in Discrete Mathematics, 36, 799-804. Lien externe
Bonami, P., Cornuejols, G., Dash, S., Fischetti, M., & Lodi, A. (2008). Projected Chvatal-Gomory cuts for mixed integer linear programs. Mathematical Programming, 113(2), 241-257. Lien externe
Fischetti, M., & Lodi, A. (2008). Repairing MIP infeasibility through local branching. Computers and Operations Research, 35(5), 1436-1445. Lien externe
Bertacco, L., Fischetti, M., & Lodi, A. (2007). A feasibility pump heuristic for general mixed-integer problems. Discrete Optimization, 4(1), 63-76. Lien externe
Fischetti, M., & Lodi, A. (2007). Optimizing over the first Chvatal closure. Mathematical Programming, 110(1), 3-20. Lien externe
Fischetti, M., Glover, F., & Lodi, A. (2005). The feasibility pump. Mathematical Programming, 104(1), 91-104. Lien externe
Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming, 98(1-3), 23-47. Lien externe
Fischetti, M., Lodi, A., Martello, S., & Toth, P. (2001). A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Science, 47(6), 833-850. Lien externe
Belotti, P., Bonami, P., Fischetti, M., Lodi, A., Monaci, M., Nogales-Gómez, A., & Salvagnin, D. (2015). On handling indicator constraints in mixed-integer programming. (Rapport technique). Non disponible
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., & Toth, P. (2001). A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. (Rapport technique). Non disponible
Liu, D., Fischetti, M., & Lodi, A. (février 2022). Learning to Search in Local Branching [Communication écrite]. 36th AAAI Conference on Artificial Intelligence (AAAI 2022). Publié dans Proceedings of the ... AAAI Conference on Artificial Intelligence, 36(4). 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
Fischetti, M., & Lodi, A. (2011). Heuristics in mixed integer programming. Dans Wiley encyclopedia of operations research and management science . Lien externe
Fischetti, M., Lodi, A., & Salvagnin, D. (2010). Just MIP it! Dans Maniezzo, V., Stützle, T., & Voß, S. (édit.), Matheuristics (Vol. 10, p. 39-70). Lien externe
Fischetti, M., Lodi, A., & Toth, P. (2007). Exact methods for the asymmetric traveling salesman problem. Dans Gutin, G., & Punnen, A. P. (édit.), The traveling salesman problem and its variations (Vol. 12, p. 169-205). Lien externe