Domenico Salvagnin

52 papers A* 4A 1B 14C 1Misc 1Journal 30

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Models and algorithms for the Time Window Assignment Traveling Salesperson Problem with stochastic travel times. Eur. J. Oper. Res. Francesco Cavaliere, Matteo Fischetti, Roberto Roberti, Domenico Salvagnin
2025	J	`jnl`	A fix-propagate-repair heuristic for mixed integer programming. Math. Program. Comput. Domenico Salvagnin, Roberto Roberti, Matteo Fischetti
2025	J	`jnl`	An improved compact formulation for the assortment optimization problem with small consideration sets. J. Oper. Res. Soc. Roberto Roberti, Domenico Salvagnin, Matteo Fischetti
2024	J	`jnl`	A strategy based on integer programming for optimal dosing and timing of preventive hypoglycemic treatments in type 1 diabetes management. Comput. Methods Programs Biomed. Jacopo Pavan, Giulia Noaro, Andrea Facchinetti, Domenico Salvagnin, Giovanni Sparacino, Simone Del Favero
2023	J	`jnl`	Incorporating Sparse and Quantized Carbohydrates Suggestions in Model Predictive Control for Artificial Pancreas in Type 1 Diabetes. IEEE Trans. Control. Syst. Technol. Jacopo Pavan, Domenico Salvagnin, Andrea Facchinetti, Giovanni Sparacino, Simone Del Favero
2023	J	`jnl`	Using multiple reference vectors and objective scaling in the Feasibility Pump. EURO J. Comput. Optim. Gioni Mexi, Timo Berthold, Domenico Salvagnin
2022	B	`conf`	Transferring Information Across Restarts in MIP. CPAIOR Timo Berthold, Gregor Hendel, Domenico Salvagnin
2021	J	`jnl`	MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. Ambros M. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp M. Christophel, Kati Jarck, Thorsten Koch, Jeff T. Linderoth, Marco E. Lübbecke, Hans D. Mittelmann, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, Yuji Shinano
2020	J	`jnl`	An exploratory computational analysis of dual degeneracy in mixed-integer programming. EURO J. Comput. Optim. Gerald Gamrath, Timo Berthold, Domenico Salvagnin
2020	B	`conf`	Implementing Automatic Benders Decomposition in a Modern MIP Solver. IPCO Pierre Bonami, Domenico Salvagnin, Andrea Tramontani
2020	A*	`conf`	Lagrangian Decomposition for Classical Planning (Extended Abstract). IJCAI Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
2019	J	`jnl`	Finding First and Most-Beautiful Queens by Integer Programming. CoRR Matteo Fischetti, Domenico Salvagnin
2019	A*	`conf`	Lagrangian Decomposition for Optimal Cost Partitioning. ICAPS Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
2019	B	`conf`	Some Experiments with Submodular Function Maximization via Integer Programming. CPAIOR Domenico Salvagnin
2019	J	`jnl`	Ten years of feasibility pump, and counting. EURO J. Comput. Optim. Timo Berthold, Andrea Lodi, Domenico Salvagnin
2018	B	`conf`	Chasing First Queens by Integer Programming. CPAIOR Matteo Fischetti, Domenico Salvagnin
2018	J	`jnl`	Faster SGD training by minibatch persistency. CoRR Matteo Fischetti, Iacopo Mandatelli, Domenico Salvagnin
2018	J	`jnl`	Improving the Randomization Step in Feasibility Pump. SIAM J. Optim. Santanu S. Dey, Andres Iroume, Marco Molinaro, Domenico Salvagnin
2018	J	`jnl`	SelfSplit parallelization for mixed-integer linear programming. Comput. Oper. Res. Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2018	B	`conf`	Symmetry Breaking Inequalities from the Schreier-Sims Table. CPAIOR Domenico Salvagnin
2017	B	`ed.`	Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings CPAIOR Domenico Salvagnin, Michele Lombardi
2017	J	`jnl`	Introduction to the CPAIOR 2017 fast track issue. Constraints An Int. J. Domenico Salvagnin, Michele Lombardi
2017	J	`jnl`	Orbital shrinking: Theory and applications. Discret. Appl. Math. Matteo Fischetti, Leo Liberti, Domenico Salvagnin, Toby Walsh
2017	J	`jnl`	Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl
2016	B	`conf`	Detecting Semantic Groups in MIP Models. CPAIOR Domenico Salvagnin
2016	Misc	`conf`	Detecting and Exploiting Global Structures in MIP. ISAIM Domenico Salvagnin
2016	J	`jnl`	Improving branch-and-cut performance by random sampling. Math. Program. Comput. Matteo Fischetti, Andrea Lodi, Michele Monaci, Domenico Salvagnin, Andrea Tramontani
2016	J	`jnl`	Mixed-integer linear programming heuristics for the prepack optimization problem. Discret. Optim. Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2016	J	`jnl`	On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez, Domenico Salvagnin
2015	B	`conf`	Branching on Multi-aggregated Variables. CPAIOR Gerald Gamrath, Anna Melchiori, Timo Berthold, Ambros M. Gleixner, Domenico Salvagnin
2015	J	`jnl`	On solving a hard quadratic 3-dimensional assignment problem. Math. Program. Comput. Hans D. Mittelmann, Domenico Salvagnin
2015	J	`jnl`	The strength of multi-row models. Math. Program. Comput. Quentin Louveaux, Laurent Poirrier, Domenico Salvagnin
2014	B	`conf`	Detecting and Exploiting Permutation Structures in MIPs. CPAIOR Domenico Salvagnin
2014	B	`conf`	Self-splitting of Workload in Parallel Computation. CPAIOR Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2013	J	`jnl`	Approximating the Split Closure. INFORMS J. Comput. Matteo Fischetti, Domenico Salvagnin
2013	B	`conf`	Cloud Branching. CPAIOR Timo Berthold, Domenico Salvagnin
2013	B	`conf`	Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods. CPAIOR Domenico Salvagnin
2012	A	`conf`	A Hybrid MIP/CP Approach for Multi-activity Shift Scheduling. CP Domenico Salvagnin, Toby Walsh
2012	J	`jnl`	Three Ideas for the Quadratic Assignment Problem. Oper. Res. Matteo Fischetti, Michele Monaci, Domenico Salvagnin
2012	J	`jnl`	Winner determination in voting trees with incomplete preferences and weighted votes. Auton. Agents Multi Agent Syst. Jérôme Lang, Maria Silvia Pini, Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable, Toby Walsh
2011	J	`jnl`	A relax-and-cut framework for Gomory mixed-integer cuts. Math. Program. Comput. Matteo Fischetti, Domenico Salvagnin
2011	J	`jnl`	MIPLIB 2010. Math. Program. Comput. Thorsten Koch, Tobias Achterberg, Erling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittelmann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, Kati Wolter
2011	A*	`conf`	The Next Best Solution. AAAI Ronen I. Brafman, Enrico Pilotto, Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable, Toby Walsh
2010	B	`conf`	A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts. CPAIOR Matteo Fischetti, Domenico Salvagnin
2010	J	`jnl`	A note on the selection of Benders' cuts. Math. Program. Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette
2010	B	`conf`	An In-Out Approach to Disjunctive Optimization. CPAIOR Matteo Fischetti, Domenico Salvagnin
2010	A*	`conf`	Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms. KR Ronen I. Brafman, Francesca Rossi, Domenico Salvagnin, K. Brent Venable, Toby Walsh
2010	—	`ch.`	Just MIP it! Matheuristics Matteo Fischetti, Andrea Lodi, Domenico Salvagnin
2010	J	`jnl`	Pruning Moves. INFORMS J. Comput. Matteo Fischetti, Domenico Salvagnin
2009	J	`jnl`	Fast Approaches to Improve the Robustness of a Railway Timetable. Transp. Sci. Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette
2009	J	`jnl`	Feasibility pump 2.0. Math. Program. Comput. Matteo Fischetti, Domenico Salvagnin
2007	C	`conf`	Fast Approaches to Robust Railway Timetabling. ATMOS Matteo Fischetti, Arrigo Zanette, Domenico Salvagnin