A carregar...
Publicação
Implementing and testing branch-and-bound algorithm for the quadratic 0-1 problem on transputers
Autores
Orientador(es)
Resumo(s)
Discrete optimization problems are very difficult to solve, even if the dimention is small. For most of them the problem of finding an ε-approximate solution is already NP-hard. The branch-and-bound algorithms are the most used algorithms for solving exactly this sort of problems.
Descrição
Palavras-chave
Quadratic 0-1 programming Branch and bound algorithms Parallel numerical algotithms
Contexto Educativo
Citação
Schutz, G.; Pires, F. M.; Ruano, A. E. Implementing and Testing Branch-and-Bound Algorithm for the Quadratic 0-1 Problem on Transputers, Trabalho apresentado em Euro XV Informs XXXIV, In Euro XV Informs XXXIV, Barcelona, 1997.