| MIPLIB 2010 T Koch, T Achterberg, E Andersen, O Bastert, T Berthold, RE Bixby, ... Mathematical Programming Computation 3 (2), 103, 2011 | 379 | 2011 |
| Fast approaches to improve the robustness of a railway timetable M Fischetti, D Salvagnin, A Zanette Transportation Science 43 (3), 321-335, 2009 | 166 | 2009 |
| A note on the selection of Benders’ cuts M Fischetti, D Salvagnin, A Zanette Mathematical Programming 124 (1), 175-182, 2010 | 128* | 2010 |
| Feasibility pump 2.0 M Fischetti, D Salvagnin Mathematical Programming Computation 1 (2-3), 201-222, 2009 | 92 | 2009 |
| 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 | 55 | 2017 |
| Three ideas for the quadratic assignment problem M Fischetti, M Monaci, D Salvagnin Operations Research 60, 954-964, 2012 | 52 | 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 (1), 130-157, 2012 | 50 | 2012 |
| 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 (3), 545-566, 2016 | 37 | 2016 |
| 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 | 27 | 2010 |
| Just MIP it! M Fischetti, A Lodi, D Salvagnin Matheuristics, 39-70, 2009 | 27 | 2009 |
| Cloud branching T Berthold, D Salvagnin International Conference on AI and OR Techniques in Constriant Programming …, 2013 | 25 | 2013 |
| Self-splitting of workload in parallel computation M Fischetti, M Monaci, D Salvagnin International Conference on AI and OR Techniques in Constriant Programming …, 2014 | 24 | 2014 |
| Orbital shrinking M Fischetti, L Liberti International Symposium on Combinatorial Optimization, 48-58, 2012 | 24* | 2012 |
| A relax-and-cut framework for Gomory mixed-integer cuts M Fischetti, D Salvagnin Mathematical Programming Computation 3 (2), 79-102, 2011 | 21 | 2011 |
| A hybrid MIP/CP approach for multi-activity shift scheduling D Salvagnin, T Walsh International Conference on Principles and Practice of Constraint …, 2012 | 20 | 2012 |
| An in-out approach to disjunctive optimization M Fischetti, D Salvagnin International Conference on Integration of Artificial Intelligence (AI) and …, 2010 | 17 | 2010 |
| Improving branch-and-cut performance by random sampling M Fischetti, A Lodi, M Monaci, D Salvagnin, A Tramontani Mathematical Programming Computation 8 (1), 113-132, 2016 | 15 | 2016 |
| A dominance procedure for integer programming D Salvagnin Master's thesis, University of Padua, 2005 | 14 | 2005 |
| Mixed-integer linear programming heuristics for the prepack optimization problem M Fischetti, M Monaci, D Salvagnin Discrete Optimization 22, 195-205, 2016 | 13 | 2016 |
| On solving a hard quadratic 3-dimensional assignment problem HD Mittelmann, D Salvagnin Mathematical Programming Computation 7 (2), 219-234, 2015 | 13 | 2015 |
Matteo FischettiUniversity of PadovaVerified email at unipd.it