Solving unconstrained binary quadratic programming problem by global equilibrium search
A new algorithm based on global equilibrium search (GES) is developed to solve an unconstrained binary quadratic programming (UBQP) problem. It is compared with the best methods of solving this problem. The GES algorithm is shown to be better both in speed and solution quality.
Saved in:
| Published in: | Cybernetics and systems analysis Vol. 47; no. 6; pp. 889 - 897 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Springer
01.11.2011
|
| Subjects: | |
| ISSN: | 1060-0396 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A new algorithm based on global equilibrium search (GES) is developed to solve an unconstrained binary quadratic programming (UBQP) problem. It is compared with the best methods of solving this problem. The GES algorithm is shown to be better both in speed and solution quality. |
|---|---|
| ISSN: | 1060-0396 |
| DOI: | 10.1007/s10559-011-9368-5 |