Schutz, G.Pires, F. M.Ruano, Antonio2013-02-012013-02-011996Schutz, 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; ARU00698http://hdl.handle.net/10400.1/2180Discrete 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.engQuadratic 0-1 programmingBranch and Bound algorithmsParallel numerical algorithmsA computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputersconference object2013-01-28