Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Identifying gene regulatory networks from experimental data
Parallel Computing - new trends in high performance computing
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
Journal of Heuristics
Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
INFORMS Journal on Computing
A Hybrid Heuristic for the p-Median Problem
Journal of Heuristics
Computational Modeling of Genetic and Biochemical Networks (Computational Molecular Biology)
Computational Modeling of Genetic and Biochemical Networks (Computational Molecular Biology)
A mathematical program to refine gene regulatory networks
Discrete Applied Mathematics
A probabilistic heuristic for a computationally difficult set covering problem
Operations Research Letters
An integer optimization approach for reverse engineering of gene regulatory networks
Discrete Applied Mathematics
| Hi-index | 0.01 |
The Weighted Gene Regulatory Network (WGRN) problem consists in pruning a regulatory network obtained from DNA microarray gene expression data, in order to identify a reduced set of candidate elements which can explain the expression of all other genes. Since the problem appears to be particularly hard for general-purpose solvers, we develop a Greedy Randomized Adaptive Search Procedure (GRASP) and refine it with three alternative Path Relinking procedures. For comparison purposes, we also develop a Tabu Search algorithm with a self-adapting tabu tenure. The experimental results show that GRASP performs better than Tabu Search and that Path Relinking significantly contributes to its effectiveness.