Una metaheurística GRASP para integración en grafos
Given an edge-weighted graph, we analyze the problem of finding an orientation of its edges and a function on its nodes, such that for each oriented edge the consistent subtraction of the function on its incident vertices (ie.: head - tail), is the best approximation in a least square sense to the o...
Guardado en:
| Autores principales: | Dubinsky, Manuel, Massri, César, Asteasuain, Fernando |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Español |
| Publicado: |
2017
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/66445 http://www.clei2017-46jaiio.sadio.org.ar/sites/default/files/Mem/SIO/sio-12.pdf |
| Aporte de: |
Ejemplares similares
-
A GRASP algorithm to solve the problem of dependent tasks scheduling in different machines
por: Tupia Anticona, Manuel
Publicado: (2006) -
Permutation of Sparse Matrices to a Specific Lower BTF using Graph Decompositions
por: Ponzoni, Ignacio, et al.
Publicado: (1998) -
Fast algorithms for some dominating induced matching problems
por: Lin, M.C., et al. -
Fast algorithms for some dominating induced matching problems
Publicado: (2014) -
Aplicación de la teoría de agentes al modelo de Grafos para la detección de patrones en textos
por: Ale, Juan María, et al.
Publicado: (2007)