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
    (submitted)
  17. 17.
    Tree Search Stabilization by Random Sampling
    M. Fischetti, A. Lodi, M. Monaci, D. Salvagnin, A. Tramontani
    (submitted)
  18. 18.
    Exact and Heuristic Approaches for Directional Sensor Control
    H. D. Mittelmann, D. Salvagnin
    (submitted)
  19. 19.
    On Solving a Hard Quadratic 3-Dimensional Assignment Problem
    H. D. Mittelmann, D. Salvagnin
    (submitted)
  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
    (submitted)
  23. 23.
    Self-split parallelization for Mixed Integer Linear Programming
    M. Fischetti, M. Monaci, D. Salvagnin
    (submitted)
  24. 24.
    Mixed-Integer Linear Programming Heuristics for the PrePack Optimization Problem
    M. Fischetti, M. Monaci, D. Salvagnin
    (submitted)

PhD Thesis

  1. Constraint Programming Techniques for Mixed Integer Programs