Domenico Salvagnin

Department of Information Engineering, Padova

just me

Publications

  1. 1.
    Fast Approaches to Improve the Robustness of a Railway Timetable
    M. Fischetti, D. Salvagnin, A. Zanette
    Transportation Science 43:321-335, 2009
  2. 2.
    Just MIP it!
    M. Fischetti, A. Lodi, D. Salvagnin
    V. Maniezzo, T. Stuetzle, S. Voss, Eds., MATHEURISTICS: Hybridizing metaheuristics and mathematical programming, Annals of Information Systems 10:39-70, 2009
  3. 3.
    Feasibility Pump 2.0
    M. Fischetti, D. Salvagnin
    Mathematical Programming Computation 1:201-222, 2009
  4. 4.
    Pruning Moves
    M. Fischetti, D. Salvagnin
    INFORMS Journal on Computing 22:108-119, 2010
  5. 5.
    A note on the selection of Benders’ cuts
    M. Fischetti, D. Salvagnin, A. Zanette
    Mathematical Programming B 124:175-182, 2010
  6. 6.
    Finding the Next Solution in Constraint- and Preference-based Knowledge Representation Formalisms
    R. Brafman, F. Rossi, D. Salvagnin, K. B. Venable, T. Walsh
    KR 2010 Proceedings, 425-433
  7. 7.
    An In-Out Approach to Disjunctive Optimization
    M. Fischetti, D. Salvagnin
    CPAIOR 2010 Proceedings, 136-140
  8. 8.
    A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts
    M. Fischetti, D. Salvagnin
    Mathematical Programming Computation 3:79-102, 2011
  9. 9.
    MIPLIB 2010 - Mixed Integer Programming Library version 5
    T. Koch, T. Achterberg, E. Andersen, O. Bastert, T. Berthold, R. Bixby, E. Danna, G. Gamrath, A. Gleixner, S. Heinz, A. Lodi, H. Mittelmann, T. Ralphs, D. Salvagnin, D. Steffy, K. Wolter
    Mathematical Programming Computation 3:103-163, 2011
  10. 10.
    Three ideas for the Quadratic Assignment Problem
    M. Fischetti, M. Monaci, D. Salvagnin
    Operations Research 60:954-964, 2012
  11. 11.
    Winner determination in voting trees with incomplete preferences and weighted votes
    J. Lang, M. S. Pini, F. Rossi, D. Salvagnin, K. B. Venable, T. Walsh
    Autonomous Agents and Multi-Agent Systems 25:130-157, 2012
  12. 12.
    A hybrid MIP/CP approach for multi-activity shift scheduling
    D. Salvagnin, T. Walsh
    CP Proceedings 633-646, 2012
  13. 13.
    Approximating the split closure
    M. Fischetti, D. Salvagnin
    INFORMS Journal on Computing 25:808-819, 2013
  14. 14.
    Cloud Branching
    T. Berthold, D. Salvagnin
    CPAIOR 2013 Proceedings, 28-43
  15. 15.
    Orbital Shrinking: a new tool for hybrid MIP/CP methods
    D. Salvagnin
    CPAIOR 2013 Proceedings, 204-215
  16. 16.
    The strength of multi-row models
    Q. Louveaux, L. Poirrier, D. Salvagnin
    Mathematical Programming Computation 7:113-148, 2015
  17. 17.
    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
  18. 18.
    Exact and Heuristic Approaches for Directional Sensor Control
    H. D. Mittelmann, D. Salvagnin
    IEEE Sensors Journal 15:6633-6639, 2015
  19. 19.
    On Solving a Hard Quadratic 3-Dimensional Assignment Problem
    H. D. Mittelmann, D. Salvagnin
    Mathematical Programming Computation 7:219-234, 2015
  20. 20.
    Detecting and exploiting permutation structures in MIPs
    D. Salvagnin
    CPAIOR 2014 Proceedings, 29-44
  21. 21.
    Self-splitting of workload in parallel computation
    M. Fischetti, M. Monaci, D. Salvagnin
    CPAIOR 2014 Proceedings, 394-404
  22. 22.
    Orbital Shrinking: Theory and Applications
    M. Fischetti, L. Liberti, D. Salvagnin, T. Walsh
    Discrete Applied Mathematics 222:109-12 2017
  23. 23.
    Self-split parallelization for Mixed Integer Linear Programming
    M. Fischetti, M. Monaci, D. Salvagnin
    Computers & Operations Research 93:101-112, 2018
  24. 24.
    Mixed-Integer Linear Programming Heuristics for the PrePack Optimization Problem
    M. Fischetti, M. Monaci, D. Salvagnin
    Discrete Optimization 22:195-205, 2016
  25. 25.
    Branching on multi-aggregated variables
    G. Gamrath, A. Melchiori, T. Berthold, A. Gleixner, D. Salvagnin
    CPAIOR 2015 Proceedings, 141-156
  26. 26.
    Thinning out Steiner trees: A node-based model for uniform edge costs
    M. Fischetti, M. Leitner, I. Ljubic, M. Luipersbeck, M. Monaci, M. Resch, D. Salvagnin, M. Sinnl
    Mathematical Programming Computation 9:203-229, 2017
  27. 27.
    On Handling Indicator Constraints in Mixed Integer Programming
    P. Belotti, P. Bonami, M. Fischetti, A. Lodi, M. Monaci, A. Nogales-Gomez, D. Salvagnin
    Computational Optimization and Applications, 1-22, 2016
  28. 28.
    Detecting Semantic Groups in MIP models
    D. Salvagnin
    CPAIOR 2016 Proceedings, 329-341
  29. 29.
    Improving the Randomization Step in Feasibility Pump
    S. Dey, A. Iroume, M. Molinaro, D. Salvagnin
    SIAM Journal on Optimization 28:355-378, 2018
  30. 30.
    Ten years of Feasibility Pump, and counting
    T. Berthold, A. Lodi, D. Salvagnin
    EURO Journal on Computational Optimization, 2018 (online)
  31. 31.
    Chasing First Queens by Integer Programming
    M. Fischetti, D. Salvagnin
    CPAIOR 2018 Proceedings, 232-244
  32. 32.
    Symmetry Breaking Inequalities from the Schreier-Sims table
    D. Salvagnin
    CPAIOR 2018 Proceedings, 521-529
  33. 33.
    Array Designer: automated optimized array design for functional near-infrared spectroscopy
    S. Brigadoi, D. Salvagnin, M. Fischetti, R. J. Cooper
    Neurophotonics 5:5-19, 2018
  34. 34.
    Some experiments with submodular function maximization via integer programming
    D. Salvagnin
    CPAIOR 2019 Proceedings, 488-501
  35. 35.
    Lagrangian Decomposition for Optimal Cost Partitioning
    F. Pommerening, G. Röger, M. Helmert, H. Cambazard, L.-M. Rousseau, D. Salvagnin
    ICAPS 2019 Proceedings, 338-347
  36. 36.
    MIPLIB 2017: Data-Driven Compilation of the 6th Mixed-Integer Programming Library
    A. Gleixner, G. Hendel, G. Gamrath, T. Achterberg, M. Bastubbe, T. Berthold, P. Christophel, K. Jarck, T. Koch, J. Linderoth, M. Lubbecke, H. Mittelmann, D. Ozyurt, T. Ralphs, D. Salvagnin, Y. Shinano
    Mathematical Programming Computation (accepted)
  37. 37.
    An Exploratory Computational Analysis of Dual Degeneracy in Mixed-integer Programming
    G. Gamrath, T. Berthold, D. Salvagnin
    EURO Journal on Computational Optimization, 1-21, 2020
  38. 38.
    Implementing Automatic Benders Decomposition in a Modern MIP Solver
    P. Bonami, D. Salvagnin, A. Tramontani
    IPCO 2020 Proceedings, 78-90
  39. 39.
    Incorporating Sparse and Quantized Carbohydrates Suggestions in Model Predictive Control for Artificial Pancreas in Type 1 Diabetes
    J. Pavan, D. Salvagnin, A. Facchinetti, G. Sparacino, S. Del Favero
    IEEE Transactions on Control Systems Technology, 2022
  40. 40.
    Transferring Information across Restarts in MIP
    T. Berthold, G. Hendel, D. Salvagnin
    CPAIOR 2022 Proceedings, 24-33
  41. 41.
    Using Multiple Reference Vectors and Objective Scaling in the Feasibility Pump
    T. Berthold, G. Mexi, D. Salvagnin
    EURO Journal on Computational Optimization, 1-18, 2023
  42. 42.
    A fix-propagate-repair heuristic for Mixed Integer Programming
    D. Salvagnin, R. Roberti, M. Fischetti
    (submitted)
  43. 43.
    A Strategy Based on Integer Programming for Determining the Optimal Dosing and Timing of Hypotreatments in Type 1 Diabetes Management
    J. Pavan, G. Noaro, A. Facchinetti, D. Salvagnin, G. Sparacino, S. Del Favero
    (submitted)
  44. 44.
    A MIP Approach to the Minimal Seed Set Problem
    A. Basaglia, D. Salvagnin
    (submitted)

PhD Thesis

  1. Constraint Programming Techniques for Mixed Integer Programs