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...
Saved in:
| Published in: | R.A.I.R.O. Recherche opérationnelle Vol. 58; no. 4; pp. 3241 - 3262 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.07.2024
|
| ISSN: | 0399-0559, 2804-7303 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!