A GRASP metaheuristic for microarray data analysis

DOI10.1016/J.COR.2012.10.008zbMath1348.90008OpenAlexW2056849274MaRDI QIDQ336713

Guglielmo Lulli, Roberto Cordone

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.10.008

zbMATH Keywords

tabu searchGRASPgene regulatory networkspath relinkingDNA microarray data

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Protein sequences, DNA sequences (92D20) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (2)

The multimode covering location problem ⋮ A variable neighborhood search algorithm for the multimode set covering problem

Uses Software

• Scatter Search
• Tabu search

Cites Work

• A mathematical program to refine gene regulatory networks
• A probabilistic heuristic for a computationally difficult set covering problem
• Greedy randomized adaptive search procedures
• Future paths for integer programming and links to artificial intelligence
• A hybrid heuristic for the \(p\)-median problem
• Probability distribution of solution time in GRASP: an experimental investigation
• An integer optimization approach for reverse engineering of gene regulatory networks
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• Random Graphs
• Identifying gene regulatory networks from experimental data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A GRASP metaheuristic for microarray data analysis