Implementing and testing branch-and-bound algorithm for the quadratic 0-1 problem on transputers

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

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

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
23.pdf		1.55 MB	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 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.

Keywords

Quadratic 0-1 programming Branch and bound algorithms Parallel numerical algotithms

URI

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

Citation

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.