| Single Allocation Hub Location with Heterogeneous Economies of Scale | 0 | 0.34 | 2022 |
| Measures of balance in combinatorial optimization | 0 | 0.34 | 2022 |
| BDD-based optimization for the quadratic stable set problem | 0 | 0.34 | 2022 |
| OptiMaP: swarm-powered Optimized 3D Mapping Pipeline for emergency response operations | 0 | 0.34 | 2022 |
| JANOS: An Integrated Predictive and Prescriptive Modeling Framework | 0 | 0.34 | 2022 |
| Nonlinear chance-constrained problems with applications to hydro scheduling | 0 | 0.34 | 2022 |
| Branch-Price-And-Cut Algorithms For The Vehicle Routing Problem With Stochastic And Correlated Travel Times | 0 | 0.34 | 2021 |
| A Note On The Lasserre Hierarchy For Different Formulations Of The Maximum Independent Set Problem | 0 | 0.34 | 2021 |
| The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights. | 0 | 0.34 | 2021 |
| Design And Implementation Of A Modular Interior-Point Solver For Linear Optimization | 0 | 0.34 | 2021 |
| An Exact Algorithmic Framework For A Class Of Mixed-Integer Programs With Equilibrium Constraints | 0 | 0.34 | 2021 |
| Tabu search for the time-dependent vehicle routing problem with time windows on a road network | 2 | 0.36 | 2021 |
| Parameterizing Branch-And-Bound Search Trees To Learn Branching Policies | 0 | 0.34 | 2021 |
| Machine-Learning-Based Column Selection For Column Generation | 0 | 0.34 | 2021 |
| A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs | 0 | 0.34 | 2020 |
| Travel speed prediction based on learning methods for home delivery | 0 | 0.34 | 2020 |
| Hybrid Models for Learning to Branch | 0 | 0.34 | 2020 |
| Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem | 1 | 0.35 | 2020 |
| On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming | 0 | 0.34 | 2020 |
| Exact Combinatorial Optimization with Graph Convolutional Neural Networks. | 0 | 0.34 | 2019 |
| Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems. | 0 | 0.34 | 2019 |
| Activation Adaptation In Neural Networks | 0 | 0.34 | 2019 |
| QPLIB: a library of quadratic programming instances | 3 | 0.38 | 2019 |
| Exact Solutions for the Carrier-Vehicle Traveling Salesman Problem | 1 | 0.35 | 2018 |
| Experiments on virtual private network design with concave capacity costs. | 1 | 0.36 | 2018 |
| Integral simplex using decomposition with primal cutting planes. | 2 | 0.38 | 2017 |
| Deep Learning for Patient-Specific Kidney Graft Survival Analysis. | 10 | 0.69 | 2017 |
| Nash equilibria in the two-player kidney exchange game. | 0 | 0.34 | 2017 |
| Cutting Planes From Wide Split Disjunctions | 0 | 0.34 | 2017 |
| Special issue on: Nonlinear and combinatorial methods for energy optimization. | 0 | 0.34 | 2017 |
| Improving branch-and-cut performance by random sampling. | 5 | 0.47 | 2016 |
| Design and Control of Public-Service Contracts and an Application to Public Transportation Systems. | 0 | 0.34 | 2016 |
| Bilevel Knapsack with Interdiction Constraints | 8 | 0.63 | 2016 |
| Scheduling M2M traffic over LTE uplink of a dense small cells network. | 0 | 0.34 | 2015 |
| Mathematical programming techniques in water network optimization. | 11 | 0.79 | 2015 |
| Generation of Antipodal Random Vectors With Prescribed Non-Stationary 2-nd Order Statistics | 6 | 0.47 | 2014 |
| Bilevel programming and the separation problem | 6 | 0.48 | 2014 |
| Integral Simplex Using Decomposition with Primal Cuts | 7 | 0.49 | 2014 |
| A Study on the Computational Complexity of the Bilevel Knapsack Problem. | 11 | 0.68 | 2014 |
| Single-commodity robust network design problem: Complexity, instances and heuristic solutions. | 3 | 0.38 | 2014 |
| On the Practical Strength of Two-Row Tableau Cuts | 6 | 0.46 | 2014 |
| A complexity and approximability study of the bilevel knapsack problem | 9 | 0.63 | 2013 |
| Mixed integer nonlinear programming tools: an updated practical overview. | 8 | 0.48 | 2013 |
| Test-assignment: a quadratic coloring problem | 1 | 0.35 | 2013 |
| A Time Bucket Formulation For The Traveling Salesman Problem With Time Windows | 16 | 0.67 | 2012 |
| Exact algorithms for the two-dimensional guillotine knapsack | 12 | 0.61 | 2012 |
| A storm of feasibility pumps for nonconvex MINLP. | 26 | 0.99 | 2012 |
| Bounding, filtering and diversification in CP-based local branching | 3 | 0.37 | 2012 |
| Models and algorithms for robust network design with several traffic scenarios | 2 | 0.37 | 2012 |
| MIPLIB 2010 | 47 | 1.71 | 2011 |
