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.
Uložené v:
| Vydané v: | Cybernetics and systems analysis Ročník 47; číslo 6; s. 889 - 897 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Springer
01.11.2011
|
| Predmet: | |
| ISSN: | 1060-0396 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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 |