A computational study of a parallel Branch and Bound algorithm for the quadratic 0-1 programming problem on transputers
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.
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.1/2180 |
| Country: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/2180 |