Domenico Salvagnin

From MaRDI portal
(Redirected from Person:266412)
Domenico Salvagnin Q266412



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Models and algorithms for the time window assignment traveling salesperson problem with stochastic travel times
European Journal of Operational Research
2026-02-12Paper
Using multiple reference vectors and objective scaling in the feasibility pump
EURO Journal on Computational Optimization
2024-04-24Paper
Implementing automatic benders decomposition in a modern MIP solver
Integer Programming and Combinatorial Optimization
2022-10-14Paper
Transferring information across restarts in MIP2022-08-30Paper
MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
Mathematical Programming Computation
2021-12-27Paper
An exploratory computational analysis of dual degeneracy in mixed-integer programming
EURO Journal on Computational Optimization
2021-01-20Paper
Ten years of feasibility pump, and counting
EURO Journal on Computational Optimization
2019-10-18Paper
Some experiments with submodular function maximization via integer programming2019-10-14Paper
Finding First and Most-Beautiful Queens by Integer Programming
(available as arXiv preprint)
2019-07-18Paper
Chasing first queens by integer programming
(available as arXiv preprint)
2018-11-21Paper
Symmetry breaking inequalities from the Schreier-Sims table2018-11-21Paper
Orbital shrinking: theory and applications
Discrete Applied Mathematics
2018-09-25Paper
SelfSplit parallelization for mixed-integer linear programming
Computers & Operations Research
2018-07-11Paper
Mixed-integer linear programming heuristics for the prepack optimization problem
Discrete Optimization
2018-05-24Paper
Thinning out Steiner trees: a node-based model for uniform edge costs
Mathematical Programming Computation
2018-02-23Paper
Improving the randomization step in feasibility pump
SIAM Journal on Optimization
2018-02-14Paper
On handling indicator constraints in mixed integer programming
Computational Optimization and Applications
2016-12-15Paper
Branching on multi-aggregated variables
Integration of AI and OR Techniques in Constraint Programming
2016-07-25Paper
Detecting semantic groups in MIP models
Integration of AI and OR Techniques in Constraint Programming
2016-06-27Paper
Improving branch-and-cut performance by random sampling
Mathematical Programming Computation
2016-04-13Paper
The strength of multi-row models
Mathematical Programming Computation
2015-07-31Paper
On solving a hard quadratic 3-dimensional assignment problem
Mathematical Programming Computation
2015-07-31Paper
Detecting and exploiting permutation structures in MIPs
Integration of AI and OR Techniques in Constraint Programming
2014-05-27Paper
Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
2013-06-04Paper
Cloud branching
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
2013-06-04Paper
Three Ideas for the Quadratic Assignment Problem
Operations Research
2012-12-07Paper
A relax-and-cut framework for Gomory mixed-integer cuts
Mathematical Programming Computation
2012-11-27Paper
Fast approaches to robust railway timetabling2012-09-28Paper
Pruning moves
INFORMS Journal on Computing
2012-07-28Paper
A note on the selection of Benders' cuts
Mathematical Programming. Series A. Series B
2010-09-16Paper
An in-out approach to disjunctive optimization
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
2010-06-22Paper
A relax-and-cut framework for Gomory's mixed-integer cuts
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
2010-06-22Paper
Feasibility pump 2.0
Mathematical Programming Computation
2009-12-09Paper


Research outcomes over time


This page was built for person: Domenico Salvagnin