default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDomenico Salvagnin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Jacopo Pavan
, Giulia Noaro, Andrea Facchinetti, Domenico Salvagnin, Giovanni Sparacino, Simone Del Favero:
A strategy based on integer programming for optimal dosing and timing of preventive hypoglycemic treatments in type 1 diabetes management. Comput. Methods Programs Biomed. 250: 108179 (2024)- 2023
- [j24]Gioni Mexi, Timo Berthold, Domenico Salvagnin:
Using multiple reference vectors and objective scaling in the Feasibility Pump. EURO J. Comput. Optim. 11: 100066 (2023) - [j23]Jacopo Pavan, Domenico Salvagnin, Andrea Facchinetti, Giovanni Sparacino, Simone Del Favero:
Incorporating Sparse and Quantized Carbohydrates Suggestions in Model Predictive Control for Artificial Pancreas in Type 1 Diabetes. IEEE Trans. Control. Syst. Technol. 31(2): 570-586 (2023) - 2022
- [c20]Timo Berthold, Gregor Hendel, Domenico Salvagnin:
Transferring Information Across Restarts in MIP. CPAIOR 2022: 24-33 - 2021
- [j22]Ambros M. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp 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:
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3): 443-490 (2021) - 2020
- [j21]Gerald Gamrath, Timo Berthold, Domenico Salvagnin:
An exploratory computational analysis of dual degeneracy in mixed-integer programming. EURO J. Comput. Optim. 8(3): 241-261 (2020) - [c19]Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin:
Lagrangian Decomposition for Classical Planning (Extended Abstract). IJCAI 2020: 4770-4774 - [c18]Pierre Bonami, Domenico Salvagnin, Andrea Tramontani:
Implementing Automatic Benders Decomposition in a Modern MIP Solver. IPCO 2020: 78-90
2010 – 2019
- 2019
- [j20]Timo Berthold, Andrea Lodi, Domenico Salvagnin:
Ten years of feasibility pump, and counting. EURO J. Comput. Optim. 7(1): 1-14 (2019) - [c17]Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin:
Lagrangian Decomposition for Optimal Cost Partitioning. ICAPS 2019: 338-347 - [c16]Domenico Salvagnin:
Some Experiments with Submodular Function Maximization via Integer Programming. CPAIOR 2019: 488-501 - [i2]Matteo Fischetti, Domenico Salvagnin:
Finding First and Most-Beautiful Queens by Integer Programming. CoRR abs/1907.08246 (2019) - 2018
- [j19]Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
SelfSplit parallelization for mixed-integer linear programming. Comput. Oper. Res. 93: 101-112 (2018) - [j18]Santanu S. Dey, Andres Iroume, Marco Molinaro, Domenico Salvagnin:
Improving the Randomization Step in Feasibility Pump. SIAM J. Optim. 28(1): 355-378 (2018) - [c15]Matteo Fischetti, Domenico Salvagnin:
Chasing First Queens by Integer Programming. CPAIOR 2018: 232-244 - [c14]Domenico Salvagnin:
Symmetry Breaking Inequalities from the Schreier-Sims Table. CPAIOR 2018: 521-529 - [i1]Matteo Fischetti, Iacopo Mandatelli, Domenico Salvagnin:
Faster SGD training by minibatch persistency. CoRR abs/1806.07353 (2018) - 2017
- [j17]Domenico Salvagnin, Michele Lombardi:
Introduction to the CPAIOR 2017 fast track issue. Constraints An Int. J. 22(4): 491-492 (2017) - [j16]Matteo Fischetti, Leo Liberti, Domenico Salvagnin, Toby Walsh:
Orbital shrinking: Theory and applications. Discret. Appl. Math. 222: 109-123 (2017) - [j15]Matteo Fischetti, Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Michele Monaci, Max Resch, Domenico Salvagnin, Markus Sinnl:
Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2): 203-229 (2017) - [e1]Domenico Salvagnin, Michele Lombardi:
Integration of AI and OR Techniques in Constraint Programming - 14th International Conference, CPAIOR 2017, Padua, Italy, June 5-8, 2017, Proceedings. Lecture Notes in Computer Science 10335, Springer 2017, ISBN 978-3-319-59775-1 [contents] - 2016
- [j14]Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez, Domenico Salvagnin:
On handling indicator constraints in mixed integer programming. Comput. Optim. Appl. 65(3): 545-566 (2016) - [j13]Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
Mixed-integer linear programming heuristics for the prepack optimization problem. Discret. Optim. 22: 195-205 (2016) - [j12]Matteo Fischetti, Andrea Lodi, Michele Monaci, Domenico Salvagnin, Andrea Tramontani:
Improving branch-and-cut performance by random sampling. Math. Program. Comput. 8(1): 113-132 (2016) - [c13]Domenico Salvagnin:
Detecting Semantic Groups in MIP Models. CPAIOR 2016: 329-341 - [c12]Domenico Salvagnin:
Detecting and Exploiting Global Structures in MIP. ISAIM 2016 - 2015
- [j11]Quentin Louveaux, Laurent Poirrier, Domenico Salvagnin:
The strength of multi-row models. Math. Program. Comput. 7(2): 113-148 (2015) - [j10]Hans D. Mittelmann, Domenico Salvagnin:
On solving a hard quadratic 3-dimensional assignment problem. Math. Program. Comput. 7(2): 219-234 (2015) - [c11]Gerald Gamrath, Anna Melchiori, Timo Berthold, Ambros M. Gleixner, Domenico Salvagnin:
Branching on Multi-aggregated Variables. CPAIOR 2015: 141-156 - 2014
- [c10]Domenico Salvagnin:
Detecting and Exploiting Permutation Structures in MIPs. CPAIOR 2014: 29-44 - [c9]Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
Self-splitting of Workload in Parallel Computation. CPAIOR 2014: 394-404 - 2013
- [j9]Matteo Fischetti, Domenico Salvagnin:
Approximating the Split Closure. INFORMS J. Comput. 25(4): 808-819 (2013) - [c8]Timo Berthold, Domenico Salvagnin:
Cloud Branching. CPAIOR 2013: 28-43 - [c7]Domenico Salvagnin:
Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods. CPAIOR 2013: 204-215 - 2012
- [j8]Jérôme Lang, Maria Silvia Pini, Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable, Toby Walsh:
Winner determination in voting trees with incomplete preferences and weighted votes. Auton. Agents Multi Agent Syst. 25(1): 130-157 (2012) - [j7]Matteo Fischetti, Michele Monaci, Domenico Salvagnin:
Three Ideas for the Quadratic Assignment Problem. Oper. Res. 60(4): 954-964 (2012) - [c6]Domenico Salvagnin, Toby Walsh:
A Hybrid MIP/CP Approach for Multi-activity Shift Scheduling. CP 2012: 633-646 - 2011
- [j6]Matteo Fischetti, Domenico Salvagnin:
A relax-and-cut framework for Gomory mixed-integer cuts. Math. Program. Comput. 3(2): 79-102 (2011) - [j5]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:
MIPLIB 2010. Math. Program. Comput. 3(2): 103-163 (2011) - [c5]Ronen I. Brafman, Enrico Pilotto, Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable, Toby Walsh:
The Next Best Solution. AAAI 2011: 1537-1540 - 2010
- [j4]Matteo Fischetti, Domenico Salvagnin:
Pruning Moves. INFORMS J. Comput. 22(1): 108-119 (2010) - [j3]Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette:
A note on the selection of Benders' cuts. Math. Program. 124(1-2): 175-182 (2010) - [c4]Matteo Fischetti, Domenico Salvagnin:
A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts. CPAIOR 2010: 123-135 - [c3]Matteo Fischetti, Domenico Salvagnin:
An In-Out Approach to Disjunctive Optimization. CPAIOR 2010: 136-140 - [c2]Ronen I. Brafman, Francesca Rossi, Domenico Salvagnin, Kristen Brent Venable, Toby Walsh:
Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms. KR 2010 - [p1]Matteo Fischetti, Andrea Lodi, Domenico Salvagnin:
Just MIP it! Matheuristics 2010: 39-70
2000 – 2009
- 2009
- [j2]Matteo Fischetti, Domenico Salvagnin:
Feasibility pump 2.0. Math. Program. Comput. 1(2-3): 201-222 (2009) - [j1]Matteo Fischetti, Domenico Salvagnin, Arrigo Zanette:
Fast Approaches to Improve the Robustness of a Railway Timetable. Transp. Sci. 43(3): 321-335 (2009) - 2007
- [c1]Matteo Fischetti, Arrigo Zanette, Domenico Salvagnin:
Fast Approaches to Robust Railway Timetabling. ATMOS 2007
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
