| MIPLIB 2010: Mixed integer programming library version 5 T Koch, T Achterberg, E Andersen, O Bastert, T Berthold, RE Bixby, ... Mathematical Programming Computation 3, 103-163, 2011 | 529 | 2011 |
| MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library A Gleixner, G Hendel, G Gamrath, T Achterberg, M Bastubbe, T Berthold, ... Mathematical Programming Computation 13 (3), 443-490, 2021 | 265 | 2021 |
| Fast approaches to improve the robustness of a railway timetable M Fischetti, D Salvagnin, A Zanette Transportation Science 43 (3), 321-335, 2009 | 245 | 2009 |
| A note on the selection of Benders’ cuts M Fischetti, D Salvagnin, A Zanette Mathematical Programming 124 (1), 175-182, 2010 | 214* | 2010 |
| On handling indicator constraints in mixed integer programming P Belotti, P Bonami, M Fischetti, A Lodi, M Monaci, A Nogales-Gómez, ... Computational Optimization and Applications 65, 545-566, 2016 | 150 | 2016 |
| Thinning out Steiner trees: a node-based model for uniform edge costs M Fischetti, M Leitner, I Ljubić, M Luipersbeck, M Monaci, M Resch, ... Mathematical Programming Computation 9 (2), 203-229, 2017 | 129 | 2017 |
| Feasibility pump 2.0 M Fischetti, D Salvagnin Mathematical Programming Computation 1 (2), 201-222, 2009 | 119 | 2009 |
| Three ideas for the quadratic assignment problem M Fischetti, M Monaci, D Salvagnin Operations Research 60, 954-964, 2012 | 67 | 2012 |
| Winner determination in voting trees with incomplete preferences and weighted votes J Lang, MS Pini, F Rossi, D Salvagnin, KB Venable, T Walsh Autonomous Agents and Multi-Agent Systems 25, 130-157, 2012 | 62 | 2012 |
| Implementing automatic Benders decomposition in a modern MIP solver P Bonami, D Salvagnin, A Tramontani Integer Programming and Combinatorial Optimization: 21st International …, 2020 | 46 | 2020 |
| Array designer: automated optimized array design for functional near-infrared spectroscopy S Brigadoi, D Salvagnin, M Fischetti, RJ Cooper Neurophotonics 5 (3), 035010-035010, 2018 | 41 | 2018 |
| Just MIP it! M Fischetti, A Lodi, D Salvagnin MATHEURISTICS: Hybridizing metaheuristics and mathematical programming, 39-70, 2010 | 41 | 2010 |
| Cloud branching T Berthold, D Salvagnin Integration of AI and OR Techniques in Constraint Programming for …, 2013 | 39 | 2013 |
| Ten years of feasibility pump, and counting T Berthold, A Lodi, D Salvagnin EURO Journal on Computational Optimization 7 (1), 1-14, 2019 | 35 | 2019 |
| Improving branch-and-cut performance by random sampling M Fischetti, A Lodi, M Monaci, D Salvagnin, A Tramontani Mathematical Programming Computation 8, 113-132, 2016 | 34 | 2016 |
| A relax-and-cut framework for Gomory mixed-integer cuts M Fischetti, D Salvagnin Mathematical Programming Computation 3 (2), 79-102, 2011 | 34 | 2011 |
| Finding the next solution in constraint-and preference-based knowledge representation formalisms R Brafman, F Rossi, D Salvagnin, KB Venable, T Walsh Twelfth International Conference on the Principles of Knowledge …, 2010 | 33 | 2010 |
| An in-out approach to disjunctive optimization M Fischetti, D Salvagnin Integration of AI and OR Techniques in Constraint Programming for …, 2010 | 33 | 2010 |
| Self-splitting of workload in parallel computation M Fischetti, M Monaci, D Salvagnin Integration of AI and OR Techniques in Constraint Programming: 11th …, 2014 | 29 | 2014 |
| A hybrid MIP/CP approach for multi-activity shift scheduling D Salvagnin, T Walsh International Conference on Principles and Practice of Constraint …, 2012 | 26 | 2012 |
Matteo FischettiUniversity of PadovaVerified email at unipd.it
