<  Back to the Polytechnique Montréal portal

Items where Author is "Fischetti, Matteo"

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0
Jump to: B | F | L
Number of items: 20.

B

Belotti, P., Bonami, P., Fischetti, M., Lodi, A., Monaci, M., Nogales-Gómez, A., & Salvagnin, D. (2016). On handling indicator constraints in mixed integer programming. Computational Optimization and Applications, 65(3), 545-566. External link

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. (Technical Report). Unavailable

Bonami, P., Cornuéjols, G., Dash, S., Fischetti, M., & Lodi, A. (2008). Projected Chvatal-Gomory cuts for mixed integer linear programs. Mathematical Programming, 113(2), 241-257. External link

Bertacco, L., Fischetti, M., & Lodi, A. (2007). A feasibility pump heuristic for general mixed-integer problems. Discrete Optimization, 4(1), 63-76. External link

F

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. External link

Fischetti, M., Lodi, A., Monaci, M., Salvagnin, D., & Tramontani, A. (2013). Tree search stabilization by random sampling. (Technical Report). Unavailable

Fischetti, M., & Lodi, A. (2011). Heuristics in mixed integer programming. In Wiley encyclopedia of operations research and management science . External link

Fischetti, M., Lodi, A., & Tramontani, A. (2011). On the separation of disjunctive cuts. Mathematical Programming, 128(1-2), 205-230. External link

Fischetti, M., Lodi, A., & Salvagnin, D. (2010). Just MIP it! In Maniezzo, V., Stützle, T., & Voß, S. (eds.), Matheuristics (Vol. 10, pp. 39-70). External link

Fischetti, M., & Lodi, A. (2010). On the knapsack closure of 0-1 integer linear programs. Electronic Notes in Discrete Mathematics, 36, 799-804. External link

Fischetti, M., & Lodi, A. (2008). Repairing MIP infeasibility through local branching. Computers and Operations Research, 35(5), 1436-1445. External link

Fischetti, M., Lodi, A., & Toth, P. (2007). Exact methods for the asymmetric traveling salesman problem. In Gutin, G., & Punnen, A. P. (eds.), The traveling salesman problem and its variations (Vol. 12, pp. 169-205). External link

Fischetti, M., & Lodi, A. (2007). Optimizing over the first Chvatal closure. Mathematical Programming, 110(1), 3-20. External link

Fischetti, M., Glover, F., & Lodi, A. (2005). The feasibility pump. Mathematical Programming, 104(1), 91-104. External link

Fischetti, M., & Lodi, A. (2005, June). Optimizing over the first Chvatal closure [Paper]. 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany. External link

Fischetti, M., & Lodi, A. (2003). Local branching. Mathematical Programming, 98(1-3), 23-47. External link

Fischetti, M., Lodi, A., & Toth, P. (2001). A branch-and-cut algorithm for the multiple depot vehicle scheduling problem. (Technical Report). Unavailable

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. External link

Fischetti, M., Lodi, A., & Toth, P. (2001, March). Solving real-world ATSP instances by branch-and-cut [Paper]. 5th International Workshop on Combinatorial Optimization, Aussois, France. External link

L

Liu, D., Fischetti, M., & Lodi, A. (2022, February). Learning to Search in Local Branching [Paper]. 36th AAAI Conference on Artificial Intelligence (AAAI 2022). Published in Proceedings of the ... AAAI Conference on Artificial Intelligence, 36(4). External link

List generated on: Sun Apr 27 06:01:11 2025 EDT