Bipartite Graph Optimization
Mostrando 1-3 de 3 artigos, teses e dissertações.
-
1. Aproximação de métricas finitas por métricas arbóreas e aplicações / Approximation of finite metrics by tree metrics and applications
Many optimization problems on graphs, especially metric problems, are easier to solve on trees. Therefore, a strategy for obtaining a good algorithm for certain problems is to obtain a tree that approximates the graph, and use a solution of the problem on the tree as an approximate solution for the problem on the original graph. We study the work of Fakcharo
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 15/12/2011
-
2. Abordagem neuro-genética para mapeamento de problemas de conexão em otimização combinatória / Neurogenetic approach for mapping connection problems in combinatorial optimization
Due to applicability constraints involved with the algorithms for solving combinatorial optimization problems, systems based on artificial neural networks and genetic algorithms are alternative methods for solving these problems in an efficient way. The genetic algorithms must its popularity to make possible cover nonlinear and extensive search spaces. On th
Publicado em: 2009
-
3. O problema da designação e sua variante parametrica
This dissertation is about the Assignment Problem: given an edge-weighted bipartite graph, find a perfect matching of minimum weight. In the first part of this work we present a detailed survey of the literature on this problem, including basic concepts and main results. In the second part, we discuss a parametric variant of this problem. In this variant, th
Publicado em: 2000