Domenico Salvagnin

Orcid: 0000-0002-0232-2244

According to our database1, Domenico Salvagnin authored at least 48 papers between 2007 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A strategy based on integer programming for optimal dosing and timing of preventive hypoglycemic treatments in type 1 diabetes management.
Comput. Methods Programs Biomed., 2024

2023
Incorporating Sparse and Quantized Carbohydrates Suggestions in Model Predictive Control for Artificial Pancreas in Type 1 Diabetes.
IEEE Trans. Control. Syst. Technol., March, 2023

Using multiple reference vectors and objective scaling in the Feasibility Pump.
EURO J. Comput. Optim., January, 2023

2022
Transferring Information Across Restarts in MIP.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2022

2021
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library.
Math. Program. Comput., 2021

2020
An exploratory computational analysis of dual degeneracy in mixed-integer programming.
EURO J. Comput. Optim., 2020

Implementing Automatic Benders Decomposition in a Modern MIP Solver.
Proceedings of the Integer Programming and Combinatorial Optimization, 2020

Lagrangian Decomposition for Classical Planning (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Ten years of feasibility pump, and counting.
EURO J. Comput. Optim., 2019

Finding First and Most-Beautiful Queens by Integer Programming.
CoRR, 2019

Some Experiments with Submodular Function Maximization via Integer Programming.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2019

Lagrangian Decomposition for Optimal Cost Partitioning.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
Improving the Randomization Step in Feasibility Pump.
SIAM J. Optim., 2018

Faster SGD training by minibatch persistency.
CoRR, 2018

SelfSplit parallelization for mixed-integer linear programming.
Comput. Oper. Res., 2018

Symmetry Breaking Inequalities from the Schreier-Sims Table.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Chasing First Queens by Integer Programming.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017
Thinning out Steiner trees: a node-based model for uniform edge costs.
Math. Program. Comput., 2017

Orbital shrinking: Theory and applications.
Discret. Appl. Math., 2017

Introduction to the CPAIOR 2017 fast track issue.
Constraints An Int. J., 2017

2016
Improving branch-and-cut performance by random sampling.
Math. Program. Comput., 2016

Mixed-integer linear programming heuristics for the prepack optimization problem.
Discret. Optim., 2016

On handling indicator constraints in mixed integer programming.
Comput. Optim. Appl., 2016

Detecting and Exploiting Global Structures in MIP.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Detecting Semantic Groups in MIP Models.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

2015
On solving a hard quadratic 3-dimensional assignment problem.
Math. Program. Comput., 2015

The strength of multi-row models.
Math. Program. Comput., 2015

Branching on Multi-aggregated Variables.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014
Detecting and Exploiting Permutation Structures in MIPs.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Self-splitting of Workload in Parallel Computation.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

2013
Approximating the Split Closure.
INFORMS J. Comput., 2013

Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Cloud Branching.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
Three Ideas for the Quadratic Assignment Problem.
Oper. Res., 2012

Winner determination in voting trees with incomplete preferences and weighted votes.
Auton. Agents Multi Agent Syst., 2012

A Hybrid MIP/CP Approach for Multi-activity Shift Scheduling.
Proceedings of the Principles and Practice of Constraint Programming, 2012

2011
MIPLIB 2010.
Math. Program. Comput., 2011

A relax-and-cut framework for Gomory mixed-integer cuts.
Math. Program. Comput., 2011

The Next Best Solution.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Just MIP it!
Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

A note on the selection of Benders' cuts.
Math. Program., 2010

Pruning Moves.
INFORMS J. Comput., 2010

Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

An In-Out Approach to Disjunctive Optimization.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

2009
Fast Approaches to Improve the Robustness of a Railway Timetable.
Transp. Sci., 2009

Feasibility pump 2.0.
Math. Program. Comput., 2009

2007
Fast Approaches to Robust Railway Timetabling.
Proceedings of the ATMOS 2007, 2007


  Loading...