On the use of Factorized Distribution Algorithms for problems defined on graphs.
Roberto SantanaCarlos Alberto Ochoa Ortíz ZezzattiMarta SotoPublished in: Electron. Notes Discret. Math. (2001)
Keyphrases
- optimization problems
- benchmark problems
- data structure
- theoretical analysis
- difficult problems
- graph theory
- problems in computer vision
- approximate solutions
- practical problems
- np complete problems
- learning algorithm
- matrix factorization
- theoretical guarantees
- graph theoretic
- phase transition
- combinatorial optimization
- computational cost
- computational complexity
- social networks