Experience
Education
Bio
Research Interest Theory and algorithms for Linear and Mixed Integer Linear Programming, Constraint Programming. Hybrid methods for Optimization. Education and Qualifications 2011-Today Assistant professor at the Department of Information Engineering, University of Padova. 2009-2011 Post-doc position at the Department of Pure and Applied Mathematics, University of Padova. 2009 Ph.D. in Computational Mathematics (Operations Research) at the University of Padova. Thesis title: Constraint Programming Techniques for Mixed Integer Linear Programs. Defended on March 26th, 2009. 2006 Licensed Professional Engineer. 2005 Master Degree (summa cum laude) in Computer Engineering at the University of Padova. Thesis title: A dominance procedure for Integer Programming. Publications − Papers 1. M. Fischetti and D. Salvagnin. Feasibility Pump 2.0. Mathematical Programming Computation, 1:201–222, 2009. 2. M. Fischetti, D. Salvagnin, and A. Zanette. Fast approaches to improve the robustness of a railway timetable. Transportation Science, 43:321–335, 2009. 3. M. Fischetti and D. Salvagnin. Pruning Moves. INFORMS Journal on Computing, 22:108– 119, 2010. 4. M. Fischetti, D. Salvagnin, and A. Zanette. A note on the selection of Benders’ cuts. Mathematical Programming B, 124:175–182, 2010. 1 Curriculum Vitae: Domenico Salvagnin 2 5. M. Fischetti and D. Salvagnin. A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts. Mathematical Programming Computation, 3:79–102, 2011. 6. T. Koch, T. Achterberg, E. Andersen, O. Bastert, T. Berthold, R. E. Bixby, E. Danna, G. Gamrath, A. M. Gleixner, S. Heinz, A. Lodi, H. Mittelmann, T. Ralphs, D. Salvagnin, D. E. Steffy, and K. Wolter. MIPLIB 2010 - Mixed Integer Programming Library version 5. Mathematical Programming Computation, 3:103–163, 2011. 7. M. Fischetti, M. Monaci, and D. Salvagnin. Three ideas for the Quadratic Assignment Problem. Operations Research, 60:954–964, 2012. 8. J. Lang, M. S. Pini, F. Rossi, D. Salvagnin, K. B. Venable, and T. Walsh. Winner determination in voting trees with incomplete preferences and weighted votes. Autonomous Agents and Multi-Agent Systems, 25:130–157, 2012. 9. M. Fischetti and D. Salvagnin. Approximating the split closure. INFORMS Journal on Computing, 25:808–819, 2013. 10. Q. Louveaux, L. Poirrier, and D. Salvagnin. The strength of multi-row models. Mathematical Programming Computation, 7:113–148, 2015. 11. H. D. Mittelmann and D. Salvagnin. On Solving a Hard Quadratic 3-Dimensional Assignment Problem. Mathematical Programming Computation, 7:219–234, 2015. 12. M. Fischetti, M. Monaci, and D. Salvagnin. Mixed-Integer Linear Programming Heuristics for the PrePack Optimization Problem. Discrete Optimization (to appear). 13. H. D. Mittelmann and D. Salvagnin. Exact and Heuristic Approaches for Directional Sensor Control. IEEE Sensors Journal (to appear).