| The assignment and loading transportation problem | 0 | 0.34 | 2021 |
| Exact solution techniques for two-dimensional cutting and packing | 1 | 0.36 | 2021 |
| A Branch-and-Cut Algorithm for Mixed-Integer Bilinear Programming | 1 | 0.35 | 2020 |
| Integer optimization with penalized fractional values: The Knapsack case. | 2 | 0.38 | 2019 |
| Interdiction Games and Monotonicity, with Application to Knapsack Problems | 0 | 0.34 | 2019 |
| SelfSplit parallelization for mixed-integer linear programming. | 0 | 0.34 | 2018 |
| A dynamic reformulation heuristic for Generalized Interdiction Problems. | 1 | 0.63 | 2018 |
| Least cost influence propagation in (social) networks. | 0 | 0.34 | 2018 |
| On the Product Knapsack Problem. | 2 | 0.52 | 2018 |
| On the use of intersection cuts for bilevel optimization. | 1 | 0.37 | 2018 |
| Minimum tiling of a rectangle by squares. | 0 | 0.34 | 2018 |
| Exact approaches for the knapsack problem with setups. | 3 | 0.41 | 2018 |
| Thinning out Steiner trees: a node-based model for uniform edge costs. | 18 | 0.71 | 2017 |
| Using a general-purpose Mixed-Integer Linear Programming solver for the practical solution of real-time train rescheduling. | 3 | 0.46 | 2017 |
| A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs | 9 | 0.53 | 2017 |
| Improving branch-and-cut performance by random sampling. | 5 | 0.47 | 2016 |
| Proximity Benders: a decomposition heuristic for stochastic programs | 2 | 0.36 | 2016 |
| Proximity search heuristics for wind farm optimal layout | 7 | 0.68 | 2016 |
| Mixed-integer linear programming heuristics for the prepack optimization problem | 3 | 0.44 | 2016 |
| Theoretical and computational results about optimality-based domain reductions | 3 | 0.37 | 2016 |
| Intersection Cuts for Bilevel Optimization. | 8 | 0.52 | 2016 |
| On handling indicator constraints in mixed integer programming. | 3 | 0.40 | 2016 |
| Models and algorithms for packing rectangles into the smallest square | 9 | 0.51 | 2015 |
| Efficiency and Robustness in a Support Platform for Intelligent Airport Ground Handling. | 3 | 0.45 | 2014 |
| Exploiting Erraticism in Search | 10 | 0.67 | 2014 |
| Self-splitting of Workload in Parallel Computation. | 10 | 0.53 | 2014 |
| Exact solution of the robust knapsack problem. | 16 | 0.73 | 2013 |
| On the Robust Knapsack Problem. | 13 | 0.72 | 2013 |
| Exact algorithms for the two-dimensional guillotine knapsack | 12 | 0.61 | 2012 |
| A note on exact and heuristic algorithms for the identical parallel machine scheduling problem | 1 | 0.34 | 2012 |
| Cutting plane versus compact formulations for uncertain (integer) linear programs. | 25 | 0.99 | 2012 |
| Complexity and approximation of an area packing problem. | 6 | 0.45 | 2012 |
| Branching on nonchimerical fractionalities. | 5 | 0.47 | 2012 |
| Three Ideas for the Quadratic Assignment Problem | 12 | 0.79 | 2012 |
| Backdoor Branching | 2 | 0.41 | 2011 |
| An exact approach for the Vertex Coloring Problem | 40 | 1.24 | 2011 |
| Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX | 11 | 0.60 | 2011 |
| An approximation scheme for the two-stage, two-dimensional knapsack problem | 2 | 0.37 | 2010 |
| Bidimensional packing by bilinear programming | 22 | 1.21 | 2009 |
| Models and heuristic algorithms for a weighted vertex coloring problem | 15 | 0.83 | 2009 |
| A Metaheuristic Approach for the Vertex Coloring Problem | 61 | 2.23 | 2008 |
| How tight is the corner relaxation? | 8 | 0.57 | 2008 |
| Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem | 15 | 0.83 | 2008 |
| Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows | 17 | 0.72 | 2007 |
| Packing into the smallest square: Worst-case analysis of lower bounds | 3 | 0.38 | 2006 |
| Lower bounds and heuristic algorithms for the k. | 0 | 0.34 | 2006 |
| A Lagrangian heuristic algorithm for a real-world train timetabling problem | 44 | 2.38 | 2006 |
| A Set-Covering-Based Heuristic Approach for Bin-Packing Problems | 36 | 1.93 | 2006 |
| Fast Approximation Schemes for Two-Stage, Two-Dimensional Bin Packing | 16 | 0.87 | 2005 |
| On the two-dimensional Knapsack Problem | 57 | 2.78 | 2004 |
