| On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in <Emphasis Type="BoldItalic">n</Emphasis>-space: missing proofs | 1 | 0.37 | 2020 |
| On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs | 1 | 0.37 | 2020 |
| QPLIB: a library of quadratic programming instances | 3 | 0.38 | 2019 |
| Fiberscip-A Shared Memory Parallelization Of Scip | 11 | 0.65 | 2018 |
| SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. | 18 | 0.77 | 2018 |
| On the Performance of NLP Solvers Within Global MINLP Solvers. | 0 | 0.34 | 2017 |
| On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space | 3 | 0.55 | 2015 |
| Validation of nominations in gas network optimization: models, methods, and solutions | 20 | 1.52 | 2015 |
| PAVER 2.0: an open source environment for automated performance analysis of benchmarking data | 3 | 0.41 | 2014 |
| Boltzmann Samplers, Pólya Theory, and Cycle Pointing | 11 | 1.04 | 2011 |
| Optimizing the design of complex energy conversion systems by Branch and Cut | 4 | 0.50 | 2010 |
| Supporting global numerical optimization of rational functions by generic symbolic convexity tests | 2 | 0.38 | 2010 |
| Comparing MIQCP solvers to a specialised algorithm for mine production scheduling | 5 | 0.56 | 2009 |
| Quantitative stability of fully random mixed-integer two-stage stochastic programs | 5 | 0.51 | 2008 |
| LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs. | 15 | 0.80 | 2008 |
| An unbiased pointing operator for unlabeled structures, with applications to counting and sampling | 6 | 0.67 | 2007 |
| Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs | 8 | 0.64 | 2007 |
| Adaptive discretization of convex multistage stochastic programs | 3 | 0.39 | 2007 |
