Multilevel + Neural Network Heuristic for the Graph Bisection Problem on Geometrically Connected Graphs

The Multilevel algorithm (ML) has been applied successfully as a metaheuristic for different combinatorial optimization problems: Graph Partitioning, Traveling Salesman, Graph Coloring, see refs. [6,7,18]. The main difficulty of ML are the convergence times needed to obtain solutions at a distance o...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Hernandez, G., Bravo, F., Montealegre, P., Nuñez, F., Salinas, L.
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2010
Materias:
Ciencias Informáticas
Graph Bisection Problem
Multilevel + Neural Network Heuristic
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/152730
http://39jaiio.sadio.org.ar/sites/default/files/39jaiio-hpc-07.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares