Publicação
A computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputers
| Resumo: | Discrete optimization problems are very difficult to solve, even if the dimantion is small. For most of them the problem of finding an ε-approximate solution is already NP-hard. |
|---|---|
| Autores principais: | Schutz, G. |
| Outros Autores: | Pires, F. M.; Ruano, Antonio |
| Assunto: | Quadratic 0-1 programming Branch and Bound algorithms Parallel numerical algorithms |
| Ano: | 1996 |
| País: | Portugal |
| Tipo de documento: | documento de conferência |
| Tipo de acesso: | acesso restrito |
| Instituição associada: | Universidade do Algarve |
| Idioma: | inglês |
| Origem: | Sapientia - Universidade do Algarve |
| Resumo: | Discrete optimization problems are very difficult to solve, even if the dimantion is small. For most of them the problem of finding an ε-approximate solution is already NP-hard. |
|---|