New approach to solve unconstrained binary quadratic problem
This paper addresses the unconstrained binary quadratic problem (UQP). This problem consists in minimizing a quadratic function a binary variables (0 − 1 variables). Accordingly, in this work, a hybrid algorithm called (HA), based on simulated annealing algorithm with some combination procedures, ha...
Uloženo v:
| Vydáno v: | R.A.I.R.O. Recherche opérationnelle Ročník 58; číslo 4; s. 3241 - 3262 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
01.07.2024
|
| ISSN: | 0399-0559, 2804-7303 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | This paper addresses the unconstrained binary quadratic problem (UQP). This problem consists in minimizing a quadratic function a binary variables (0
−
1 variables). Accordingly, in this work, a hybrid algorithm called (HA), based on simulated annealing algorithm with some combination procedures, have been proposed and a branch and bound procedure, based on this algorithm (HA) and semidefinite programming problem (SDP), has been applied. The purpose of this approach is to facilitate the resolution of the initial problem and reduce its dimension by using some fixing criteria in a repeat loop. Numerical results are presented to consolidate the demonstrated theoretical results and prove effectiveness and performance in speed and quality of our new approach. |
|---|---|
| ISSN: | 0399-0559 2804-7303 |
| DOI: | 10.1051/ro/2024087 |