| On Characterizing The Class Of Cographic Signed-Graphic Matroids | 0 | 0.34 | 2021 |
| Signed-graphic matroids with all-graphic cocircuits. | 0 | 0.34 | 2017 |
| A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem | 4 | 0.39 | 2015 |
| On the decomposition of quaternary signed-graphic matroids. | 0 | 0.34 | 2015 |
| Recognition of overlap graphs | 1 | 0.37 | 2014 |
| Decomposition of Binary Signed-Graphic Matroids. | 1 | 0.37 | 2013 |
| A new greedy algorithm for the quadratic assignment problem. | 1 | 0.36 | 2013 |
| Decomposition of Binary Signed-Graphic Matroids | 1 | 0.38 | 2010 |
| Regular Matroids With Graphic Cocircuits | 1 | 0.37 | 2009 |
| On the representability of totally unimodular matrices on bidirected graphs | 1 | 0.39 | 2009 |
| Quadratic mixed integer programming and support vectors for deleting outliers in robust regression | 3 | 0.51 | 2009 |
| GRASP with path relinking for the weighted MAXSAT problem | 21 | 0.82 | 2006 |
| The Matching Predicate And A Filtering Scheme Based On Matroids | 0 | 0.34 | 2006 |
| GRASP with path-relinking for the weighted maximum satisfiability problem | 3 | 0.48 | 2005 |
| Approximate solutions to the turbine balancing problem | 7 | 0.71 | 2001 |
| Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP | 15 | 0.79 | 2000 |
| A GRASP for Computing Approximate Solutions for the Three-Index Assignment Problem | 1 | 0.39 | 2000 |
| A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem. | 8 | 1.41 | 1997 |
| Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP | 28 | 3.29 | 1997 |
| A Parallel GRASP for MAX-SAT Problems | 15 | 0.95 | 1996 |
| Approximate Solution Of Weighted Max-Sat Problems Using Grasp | 34 | 5.14 | 1996 |
| Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP | 25 | 3.64 | 1995 |
