Una metaheurística GRASP para integración en grafos

Dubinsky, Manuel; Massri, César; Asteasuain, Fernando

dc.contributor.author	Dubinsky, Manuel
dc.contributor.author	Massri, César; Asteasuain, Fernando
dc.date.accessioned	2024-08-08T15:59:30Z
dc.date.available	2024-08-08T15:59:30Z
dc.date.issued	2017
dc.identifier.issn	2451-7550
dc.identifier.other	http://sedici.unlp.edu.ar/handle/10915/66445
dc.identifier.uri	https://undavdigital.undav.edu.ar/xmlui/handle/20.500.13069/3499
dc.description	Fil: Dubinsky, Manuel. Universidad Nacional de Avellaneda. Departamento de Tecnología y Administración; Argentina
dc.description	Fil: Massri, César. Universidad de CAECE. Consejo Nacional de Investigaciones Científicas y Técnicas
dc.description	Fil: Asteasuain, Fernando. Universidad Nacional de Avellaneda. Departamento de Tecnología y Administración; Argentina
dc.description.abstract	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 original edge-weighted function. We present a simple GRASP algorithm to find a “good” solution that is suitable for distributed execution.
dc.format.mimetype	application/pdf
dc.language.iso	eng
dc.publisher	Sociedad Argentina de Informática e Investigación Operativa
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Graph algorithms
dc.title	Una metaheurística GRASP para integración en grafos
dc.type	info:eu-repo/semantics/conferenceObject
dc.type	info:ar-repo/semantics/documento de conferencia
dc.type	info:eu-repo/semantics/publishedVersion
dcterms.license	http://creativecommons.org/licenses/by-nc-sa/4.0/
local.eventos.nombregeneral	Simposio Argentino de Investigación Operativa (SIO) - JAIIO 46
local.eventos.numero	XV
local.eventos.lugar	Argentina