Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
International Journal of Combinatorial Optimization Problems and Informatics
2012
|
| Subjects: | |
| Online Access: | https://www.redalyc.org/articulo.oa?id=265224466002 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- GRASP with Path Relinking for the SumCut Problem Jesús Sánchez-Oro Abraham Duarte Computación GRASP SumCut Metaheuristic Path Relinking This paper proposes a GRASP algorithm combined with Path Relinking to solve the SumCut minimization problem. In the SumCut problem one is given a graph with n nodes and must label the nodes in a way that each node receives a unique label from the set{1, 2,..., n}, in order to minimize the sum cut of the generated solution. The SumCut problem is really important in archeology (in seriation tasks) and in genetics, helping in the Human Genome Project. This problem is equivalent to the Profile problem, because a solution for SumCut is reversal solution for Profile problem. Experimental results show that the GRASP and Path Relinking methods presented outperform in terms of average percentage deviation the results from the State of the Art using shorter CPU time. 2012 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265224466002 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.1 Vol.3