A computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputers
| Data(s) |
01/02/2013
01/02/2013
1996
28/01/2013
|
|---|---|
| Identificador |
Schutz, G.; Pires, F. M.; Ruano, A. E. A computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputers, Trabalho apresentado em 2nd Internacional Meeting on Vector and Parallel Processing (VECPAR’96), In 2nd Internacional Meeting on Vector and Parallel Processing (VECPAR’96), Porto, 1996. AUT: GSC00606; MPI00450; ARU00698 |
| Idioma(s) |
eng |
| Direitos |
restrictedAccess |
| Palavras-Chave | #Quadratic 0-1 programming #Branch and Bound algorithms #Parallel numerical algorithms |
| Tipo |
conferenceObject |
| 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. |
