Implementing and testing branch-and-bound algorithm for the quadratic 0-1 problem on transputers
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.
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2013
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10400.1/2212 |
| Country: | Portugal |
| Oai: | oai:sapientia.ualg.pt:10400.1/2212 |