The following pages link to Domenico Salvagnin (Q266412):
Displaying 31 items.
- Improving branch-and-cut performance by random sampling (Q266414) (← links)
- Feasibility pump 2.0 (Q1043854) (← links)
- Chasing first queens by integer programming (Q1626730) (← links)
- Symmetry breaking inequalities from the Schreier-Sims table (Q1626777) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- Thinning out Steiner trees: a node-based model for uniform edge costs (Q1699615) (← links)
- Mixed-integer linear programming heuristics for the prepack optimization problem (Q1751183) (← links)
- A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- Transferring information across restarts in MIP (Q2170173) (← links)
- An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
- Some experiments with submodular function maximization via integer programming (Q2327278) (← links)
- Ten years of feasibility pump, and counting (Q2329705) (← links)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- The strength of multi-row models (Q2516350) (← links)
- On solving a hard quadratic 3-dimensional assignment problem (Q2516353) (← links)
- A note on the selection of Benders' cuts (Q2638375) (← links)
- Detecting Semantic Groups in MIP Models (Q2815122) (← links)
- Pruning Moves (Q2899042) (← links)
- (Q2917367) (← links)
- Three Ideas for the Quadratic Assignment Problem (Q3144407) (← links)
- A Relax-and-Cut Framework for Gomory’s Mixed-Integer Cuts (Q3569926) (← links)
- An In-Out Approach to Disjunctive Optimization (Q3569927) (← links)
- Improving the Randomization Step in Feasibility Pump (Q4603044) (← links)
- Cloud Branching (Q4922902) (← links)
- Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods (Q4922913) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
- Detecting and Exploiting Permutation Structures in MIPs (Q5418726) (← links)
- Branching on Multi-aggregated Variables (Q5741462) (← links)
- Using multiple reference vectors and objective scaling in the feasibility pump (Q6491331) (← links)
