A computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputers

Schutz, G.; Pires, F. M.; Ruano, Antonio

http://hdl.handle.net/10400.1/2180

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
55.pdf		804.72 KB	Adobe PDF	Download

Send Feedback

Authors

Schutz, G.

Pires, F. M.

Ruano, Antonio

Abstract(s)

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.

Keywords

Quadratic 0-1 programming Branch and Bound algorithms Parallel numerical algorithms

URI

http://hdl.handle.net/10400.1/2180

Citation

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.