| Structural damage detection and localization using decision tree ensemble and vibration data | 0 | 0.34 | 2021 |
| The Constrained Forward Shortest Path Tour Problem: Mathematical Modeling And Grasp Approximate Solutions | 1 | 0.35 | 2021 |
| Vehicular Crowd-Sensing: A Parametric Routing Algorithm To Increase Spatio-Temporal Road Network Coverage | 0 | 0.34 | 2021 |
| An efficient exact approach for the constrained shortest path tour problem | 1 | 0.35 | 2020 |
| MaNGA: a novel multi-objective multi-niche genetic algorithm for QSAR modelling. | 0 | 0.34 | 2020 |
| Shortest Path Tour Problem with Time Windows | 1 | 0.35 | 2020 |
| A Biased-Randomized Iterated Local Search For The Distributed Assembly Permutation Flow-Shop Problem | 2 | 0.36 | 2020 |
| Tabu search for min-max edge crossing in graphs | 0 | 0.34 | 2020 |
| Enhancing and extending the classical GRASP framework with biased randomisation and simulation | 0 | 0.34 | 2019 |
| An auction-based approach for the re-optimization shortest path tree problem | 0 | 0.34 | 2019 |
| Heuristics for the Constrained Incremental Graph Drawing Problem. | 0 | 0.34 | 2019 |
| Performance Evaluation Of The Vnt Reconfiguration Algorithm Based On Traffic Prediction | 0 | 0.34 | 2018 |
| Integrating biased-Randomized grasp with Monte Carlo simulation for solving the Vehicle Routing Problem with stochastic demands. | 0 | 0.34 | 2018 |
| A GRASP for the Minimum Cost SAT Problem. | 0 | 0.34 | 2017 |
| Adapting The Virtual Network Topology To Near Future Traffic | 1 | 0.35 | 2017 |
| On The Fast Solution Of The P-Center Problem | 0 | 0.34 | 2017 |
| A New Local Search for the p-Center Problem Based on the Critical Vertex Concept. | 0 | 0.34 | 2017 |
| Integer programming models for feature selection: New extensions and a randomized solution algorithm. | 24 | 0.80 | 2016 |
| A new GRASP metaheuristic for biclustering of gene expression data. | 0 | 0.34 | 2016 |
| Combining simulation with a GRASP metaheuristic for solving the permutation flow-shop problem with stochastic processing times. | 0 | 0.34 | 2016 |
| The constrained shortest path tour problem. | 5 | 0.51 | 2016 |
| Hybridizations Of Grasp With Path Relinking For The Far From Most String Problem | 3 | 0.41 | 2016 |
| The solution of large-scale Minimum Cost SAT Problem as a tool for data analysis in bioinformatics. | 0 | 0.34 | 2016 |
| An Efficient Coded Multicasting Scheme Preserving The Multiplicative Caching Gain | 10 | 0.81 | 2015 |
| An edge-swap heuristic for generating spanning trees with minimum number of branch vertices. | 7 | 0.53 | 2014 |
| GRASP with Path-Relinking for the Maximum Contact Map Overlap Problem. | 1 | 0.35 | 2014 |
| Foreword to the special issue SEA 2010 | 0 | 0.34 | 2013 |
| Hybrid Metaheuristics for the Far From Most String Problem. | 4 | 0.45 | 2013 |
| Complexity analysis and optimization of the shortest path tour problem. | 8 | 0.66 | 2012 |
| Efficient solutions for the far from most string problem. | 5 | 0.45 | 2012 |
| A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution | 12 | 0.61 | 2011 |
| An iterative refinement algorithm for the minimum branch vertices problem | 5 | 0.45 | 2011 |
| Solving A Bus Driver Scheduling Problem With Randomized Multistart Heuristics | 4 | 0.39 | 2011 |
| Solving Biclustering with a GRASP-Like Metaheuristic: Two Case-Studies on Gene Expression Analysis | 0 | 0.34 | 2011 |
| GRASP with path-relinking for data clustering: a case study for biological data | 4 | 0.39 | 2011 |
| GRASP: basic components and enhancements | 31 | 1.32 | 2011 |
| Experimental Algorithms, 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010. Proceedings | 38 | 2.34 | 2010 |
| Automatic tuning of GRASP with path-relinking heuristics with a biased random-key genetic algorithm | 5 | 0.41 | 2010 |
| Logic based methods for SNPs tagging and reconstruction | 1 | 0.37 | 2010 |
| A new meta-heuristic for the Bus Driver Scheduling Problem: GRASP combined with Rollout | 5 | 0.54 | 2007 |
| GRASP with path relinking for the weighted MAXSAT problem | 21 | 0.82 | 2006 |
| GRASP with path-relinking for the weighted maximum satisfiability problem | 3 | 0.48 | 2005 |
| Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept | 0 | 0.34 | 2003 |
| Randomized Heuristics for the Max-Cut Problem | 74 | 3.28 | 2002 |
| Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP | 11 | 1.09 | 2001 |
