Buscas alternativas:
complete problems » complex problems (Expandir a busca), coupled problems (Expandir a busca), componentes problema (Expandir a busca)
classes algorithm » clusters algorithm (Expandir a busca), massey algorithm (Expandir a busca), based algorithm (Expandir a busca)
problems classes » problem classes (Expandir a busca), problem class (Expandir a busca), problemas classicos (Expandir a busca)
algorithm binary » algorithms library (Expandir a busca)
binary method » boundary method (Expandir a busca), boundary methods (Expandir a busca)
complete problems » complex problems (Expandir a busca), coupled problems (Expandir a busca), componentes problema (Expandir a busca)
classes algorithm » clusters algorithm (Expandir a busca), massey algorithm (Expandir a busca), based algorithm (Expandir a busca)
problems classes » problem classes (Expandir a busca), problem class (Expandir a busca), problemas classicos (Expandir a busca)
algorithm binary » algorithms library (Expandir a busca)
binary method » boundary method (Expandir a busca), boundary methods (Expandir a busca)
1
“... subconjuntos seja maximizada. Apesar da simplicidade da sua definição, o problema do corte máximo é NP-Completo...”
Algoritmos para resolução do problema do corte máximo : abordagem exata e meta-heurísticas
Dissertação