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.
Gespeichert in:
| Veröffentlicht in: | Cybernetics and systems analysis Jg. 47; H. 6; S. 889 - 897 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Springer
01.11.2011
|
| Schlagworte: | |
| ISSN: | 1060-0396 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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 |