| Minimizing Total Completion Time In The Two-Machine No-Idle No-Wait Flow Shop Problem | 0 | 0.34 | 2021 |
| Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights | 0 | 0.34 | 2020 |
| New exact approaches and approximation results for the Penalized Knapsack Problem. | 2 | 0.40 | 2019 |
| Lower Bounds And A New Exact Approach For The Bilevel Knapsack With Interdiction Constraints | 0 | 0.34 | 2019 |
| No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths. | 0 | 0.34 | 2019 |
| Improved Approximation Bounds Via Problem Independent Linear Programming Modeling. | 0 | 0.34 | 2019 |
| A tight linear time $$\frac{13}{12}$$1312-approximation algorithm for the $$P2 || C_{\max }$$P2||Cmax problem | 0 | 0.34 | 2019 |
| Approximating the 3-period Incremental Knapsack Problem. | 0 | 0.34 | 2018 |
| MILP and Max-Clique based heuristics for the Eternity II puzzle. | 0 | 0.34 | 2017 |
| Dynamic programming algorithms, efficient solution of the LP-relaxation and approximation schemes for the Penalized Knapsack Problem. | 2 | 0.44 | 2017 |
| A new exact approach for the 0-1 Collapsing Knapsack Problem. | 4 | 0.44 | 2017 |
| Minimizing the number of tardy jobs in two-machine settings with common due date. | 0 | 0.34 | 2017 |
| Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. | 1 | 0.36 | 2017 |
| An exact approach for the 0-1 knapsack problem with setups. | 8 | 0.58 | 2017 |
| Heuristic approaches for a domestic energy management system. | 2 | 0.39 | 2017 |
| No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths. | 0 | 0.34 | 2017 |
| A constraint generation approach for two-machine shop problems with jobs selection. | 1 | 0.36 | 2017 |
| An exact semidefinite programming approach for the max-mean dispersion problem. | 0 | 0.34 | 2017 |
| A hybrid three-phase approach for the Max-Mean Dispersion Problem | 5 | 0.41 | 2016 |
| MP or not MP: that is the question | 0 | 0.34 | 2016 |
| Erratum—One Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons | 0 | 0.34 | 2015 |
| The Red-Blue transportation problem. | 5 | 0.44 | 2014 |
| Reoptimization in machine scheduling. | 5 | 0.43 | 2014 |
| A Constraint Generation Approach for the Two-Machine Flow Shop Problem with Jobs Selection. | 2 | 0.39 | 2014 |
| A hybrid heuristic approach for single machine scheduling with release times | 6 | 0.46 | 2014 |
| A matheuristic approach for the two-machine total completion time flow shop problem. | 10 | 0.60 | 2014 |
| The Selective Fixing Algorithm for the closest string problem | 1 | 0.38 | 2014 |
| A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem. | 3 | 0.45 | 2014 |
| On the max min vertex cover Problem. | 6 | 0.53 | 2013 |
| Improving an exact approach for solving separable integer quadratic knapsack problems | 0 | 0.34 | 2012 |
| Efficient algorithms for the max k-vertex cover problem. | 3 | 0.39 | 2012 |
| Discrete-time, economic lot scheduling problem on multiple, non-identical production lines. | 1 | 0.35 | 2011 |
| A matheuristic approach for the total completion time two-machines permutation flow shop problem | 7 | 0.57 | 2011 |
| Approximating the metric 2-Peripatetic Salesman Problem | 0 | 0.34 | 2010 |
| Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 | 4 | 0.61 | 2009 |
| Probabilistic graph-coloring in bipartite and split graphs | 3 | 0.37 | 2009 |
| A heuristic approach for the max-min diversity problem based on max-clique | 17 | 0.96 | 2009 |
| Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems | 0 | 0.34 | 2008 |
| Complexity of single machine scheduling problems under scenario-based uncertainty | 29 | 1.28 | 2008 |
| Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria | 12 | 0.84 | 2007 |
| Improved worst-case complexity for the MIN 3-SET COVERING problem | 1 | 0.37 | 2007 |
| A "maximum node clustering" problem | 0 | 0.34 | 2006 |
| Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2 | 0 | 0.34 | 2006 |
| Computing optimal solutions for the MIN 3-SET COVERING problem | 1 | 0.37 | 2005 |
| A greedy-based neighborhood search approach to a nurse rostering problem | 40 | 1.75 | 2004 |
| Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem | 3 | 0.61 | 2004 |
| Solving the Hub location problem in telecommunication network design: A local search approach | 22 | 1.13 | 2004 |
| On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints | 4 | 0.52 | 2004 |
| An improved branch-and-bound algorithm for the two machine total completion time flow shop problem | 25 | 3.12 | 2002 |
| Minimizing tardy jobs in a flowshop with common due date | 17 | 1.47 | 2000 |
