| Implementing Automatic Benders Decomposition in a Modern MIP Solver. | 0 | 0.34 | 2020 |
| An exploratory computational analysis of dual degeneracy in mixed-integer programming | 0 | 0.34 | 2020 |
| Lagrangian Decomposition for Classical Planning (Extended Abstract). | 0 | 0.34 | 2020 |
| Lagrangian Decomposition for Optimal Cost Partitioning. | 0 | 0.34 | 2019 |
| Some Experiments with Submodular Function Maximization via Integer Programming. | 0 | 0.34 | 2019 |
| Ten years of feasibility pump, and counting | 1 | 0.35 | 2019 |
| SelfSplit parallelization for mixed-integer linear programming. | 0 | 0.34 | 2018 |
| Faster SGD training by minibatch persistency. | 0 | 0.34 | 2018 |
| Improving the Randomization Step in Feasibility Pump. | 0 | 0.34 | 2018 |
| Thinning out Steiner trees: a node-based model for uniform edge costs. | 18 | 0.71 | 2017 |
| Introduction to the CPAIOR 2017 fast track issue. | 0 | 0.34 | 2017 |
| Orbital shrinking: Theory and applications. | 0 | 0.34 | 2017 |
| Improving branch-and-cut performance by random sampling. | 5 | 0.47 | 2016 |
| Detecting and Exploiting Global Structures in MIP. | 0 | 0.34 | 2016 |
| Mixed-integer linear programming heuristics for the prepack optimization problem | 3 | 0.44 | 2016 |
| Detecting Semantic Groups In Mip Models | 1 | 0.37 | 2016 |
| On handling indicator constraints in mixed integer programming. | 3 | 0.40 | 2016 |
| The strength of multi-row models | 2 | 0.37 | 2015 |
| On solving a hard quadratic 3-dimensional assignment problem | 3 | 0.41 | 2015 |
| Self-splitting of Workload in Parallel Computation. | 10 | 0.53 | 2014 |
| Detecting and Exploiting Permutation Structures in MIPs. | 0 | 0.34 | 2014 |
| Cloud Branching. | 0 | 0.34 | 2013 |
| Approximating the Split Closure | 3 | 0.39 | 2013 |
| Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods. | 3 | 0.42 | 2013 |
| Winner determination in voting trees with incomplete preferences and weighted votes | 27 | 1.07 | 2012 |
| A hybrid MIP/CP approach for multi-activity shift scheduling | 7 | 0.49 | 2012 |
| Three Ideas for the Quadratic Assignment Problem | 12 | 0.79 | 2012 |
| MIPLIB 2010 | 47 | 1.71 | 2011 |
| The Next Best Solution. | 1 | 0.36 | 2011 |
| A relax-and-cut framework for Gomory mixed-integer cuts | 10 | 0.57 | 2011 |
| Pruning Moves | 2 | 0.37 | 2010 |
| A note on the selection of Benders’ cuts | 38 | 1.13 | 2010 |
| An in-out approach to disjunctive optimization | 14 | 0.76 | 2010 |
| Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms | 13 | 0.92 | 2010 |
| Feasibility pump 2.0 | 17 | 0.76 | 2009 |
| Fast Approaches to Improve the Robustness of a Railway Timetable | 43 | 2.04 | 2009 |
| Fast Approaches to Robust Railway Timetabling | 6 | 0.84 | 2007 |
