GRASP with Path Relinking for the SumCut Problem
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...
Guardat en:
| Publicat a: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Autors principals: | , |
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
International Journal of Combinatorial Optimization Problems and Informatics
2012
|
| Matèries: | |
| Accés en línia: | https://www.redalyc.org/articulo.oa?id=265224466002 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|