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...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:R.A.I.R.O. Recherche opérationnelle Ročník 58; číslo 4; s. 3241 - 3262
Hlavní autori: Rabih, Battikh, Hassan, Alabboud, Bassem, Jida, Adnan, Yassine
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: 01.07.2024
ISSN:0399-0559, 2804-7303
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract 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.
AbstractList 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.
Author Adnan, Yassine
Hassan, Alabboud
Rabih, Battikh
Bassem, Jida
Author_xml – sequence: 1
  givenname: Battikh
  surname: Rabih
  fullname: Rabih, Battikh
– sequence: 2
  givenname: Alabboud
  surname: Hassan
  fullname: Hassan, Alabboud
– sequence: 3
  givenname: Jida
  surname: Bassem
  fullname: Bassem, Jida
– sequence: 4
  givenname: Yassine
  surname: Adnan
  fullname: Adnan, Yassine
BookMark eNotj81KAzEURoNUcKzd-ARZC2NvficBN1K0CkU3uh5uMhkcmCZjMlV8eyt29W0OH-dckkVMMRByzeCWgWLrnNYcuATTnJGKG5B1I0AsSAXC2hqUshdkVcrgjrDR2oKqyN1L-KY4TTmh_6BzoiWNX4Eeok-xzBmHGDrqhoj5h34esMs4D54ecTeG_RU573EsYXXaJXl_fHjbPNW71-3z5n5Xe65hrhl6idZxLrRqlMJeCdmBcNwFZF7qjgvJrbe96RthrJUBUQuQknFrg9FiSW7-f31OpeTQt1Me9kellkH7l97m1J7SxS98hE0i
Cites_doi 10.1006/jpdc.1996.0121
10.2172/947970
10.1063/1.1699114
10.2514/3.10834
10.1371/journal.pone.0227538
10.1111/j.1475-3995.2000.tb00200.x
10.1051/ro/2018095
10.1007/978-1-4615-4381-7
10.1287/mnsc.44.3.336
10.1016/j.cpc.2019.107006
10.1088/0305-4470/15/10/028
10.14419/ijet.v9i1.29918
10.1016/j.disopt.2016.01.005
10.1137/S1052623497328008
10.1145/3293320.3293333
10.1007/BF00940812
10.1109/ICCDA.2010.5541300
10.1016/0167-6377(92)90043-3
10.1287/opre.18.1.24
10.1007/s10898-009-9507-y
10.1117/12.2558832
10.1016/S0377-2217(98)00359-2
10.1126/science.220.4598.671
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1051/ro/2024087
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2804-7303
EndPage 3262
ExternalDocumentID 10_1051_ro_2024087
GroupedDBID --K
-E.
.FH
0E1
123
1B1
4.4
5VS
74X
74Y
7~V
8FE
8FG
AADXX
AAFWJ
AAOGA
AAOTM
AAYXX
ABGDZ
ABKKG
ABNSH
ABUBZ
ABZDU
ACACO
ACGFS
ACIMK
ACIWK
ACQPF
ACRPL
ACZPN
ADNMO
AEMTW
AFAYI
AFHSK
AFUTZ
AGQPQ
AJPFC
ALMA_UNASSIGNED_HOLDINGS
AMVHM
ARABE
ASPBG
AVWKF
AZPVJ
BPHCQ
C0O
CITATION
CS3
DC4
EBS
EJD
FAM
HG-
HST
HZ~
I-F
I.6
IHE
IL9
I~P
J36
J38
J3A
K60
K6V
K6~
L6V
L98
LO0
M-V
M41
NIF
O9-
OAV
P62
PQQKQ
PROAC
RCA
ROL
RPZ
RR0
S6-
WQ3
WXU
ID FETCH-LOGICAL-c260t-1ac4a9b22365755af534d03b2bea1c46d23429c9f8f738994eaa630441299e863
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001288586300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0399-0559
IngestDate Sat Nov 29 04:47:33 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c260t-1ac4a9b22365755af534d03b2bea1c46d23429c9f8f738994eaa630441299e863
OpenAccessLink https://www.rairo-ro.org/articles/ro/pdf/forth/ro230357.pdf
PageCount 22
ParticipantIDs crossref_primary_10_1051_ro_2024087
PublicationCentury 2000
PublicationDate 2024-07-01
PublicationDateYYYYMMDD 2024-07-01
PublicationDate_xml – month: 07
  year: 2024
  text: 2024-07-01
  day: 01
PublicationDecade 2020
PublicationTitle R.A.I.R.O. Recherche opérationnelle
PublicationYear 2024
References Benson (R6) 2000; 10
Morrison (R23) 2016; 19
Lodi (R19) 1999; 119
R27
Pardalos (R25) 1992; 11
Metropolis (R20) 1953; 21
R29
Glover (R13) 1998; 44
Mitten (R22) 1970; 18
Barahona (R3) 1982; 15
R1
R2
R4
Negre (R24) 2020; 15
R5
Deb (R11) 1991; 29
Dinh (R26) 2010; 48
R7
Khorbatly (R16) 2020; 54
R9
Laporte (R18) 2000; 7
Ram (R15) 1996; 37
Kirkpatrick (R17) 1983; 220
R10
Misevičius (R21) 2004; 32
El Chakik (R12) 2020; 9
R14
Čern`y (R8) 1985; 45
Willsch (R28) 2020; 248
References_xml – volume: 37
  start-page: 207
  year: 1996
  ident: R15
  publication-title: J. Parallel Distrib. Comput.
  doi: 10.1006/jpdc.1996.0121
– ident: R5
  doi: 10.2172/947970
– volume: 21
  start-page: 1087
  year: 1953
  ident: R20
  publication-title: J. Chem. Phys.
  doi: 10.1063/1.1699114
– volume: 29
  start-page: 2013
  year: 1991
  ident: R11
  publication-title: AIAA J.
  doi: 10.2514/3.10834
– volume: 15
  start-page: e0227538
  year: 2020
  ident: R24
  publication-title: Plos One
  doi: 10.1371/journal.pone.0227538
– volume: 7
  start-page: 285
  year: 2000
  ident: R18
  publication-title: Int. Trans. Oper. Res.
  doi: 10.1111/j.1475-3995.2000.tb00200.x
– ident: R1
– ident: R10
– volume: 54
  start-page: 19
  year: 2020
  ident: R16
  publication-title: RAIRO-Oper. Res.
  doi: 10.1051/ro/2018095
– ident: R29
  doi: 10.1007/978-1-4615-4381-7
– volume: 44
  start-page: 336
  year: 1998
  ident: R13
  publication-title: Manage. Sci.
  doi: 10.1287/mnsc.44.3.336
– volume: 248
  start-page: 107006
  year: 2020
  ident: R28
  publication-title: Comput. Phys. Commun.
  doi: 10.1016/j.cpc.2019.107006
– volume: 15
  start-page: 3241
  year: 1982
  ident: R3
  publication-title: J. Phys. A: Math. General
  doi: 10.1088/0305-4470/15/10/028
– volume: 9
  start-page: 59
  year: 2020
  ident: R12
  publication-title: Int. J. Eng. Technol.
  doi: 10.14419/ijet.v9i1.29918
– ident: R14
– volume: 19
  start-page: 79
  year: 2016
  ident: R23
  publication-title: Discrete Optim.
  doi: 10.1016/j.disopt.2016.01.005
– volume: 10
  start-page: 443
  year: 2000
  ident: R6
  publication-title: SIAM J. Optim.
  doi: 10.1137/S1052623497328008
– ident: R9
  doi: 10.1145/3293320.3293333
– volume: 45
  start-page: 41
  year: 1985
  ident: R8
  publication-title: J. Optim. Theory App.
  doi: 10.1007/BF00940812
– ident: R7
  doi: 10.1109/ICCDA.2010.5541300
– volume: 32
  start-page: 2004
  year: 2004
  ident: R21
  publication-title: Inf. Technol. Control
– volume: 11
  start-page: 119
  year: 1992
  ident: R25
  publication-title: Oper. Res. Lett.
  doi: 10.1016/0167-6377(92)90043-3
– volume: 18
  start-page: 24
  year: 1970
  ident: R22
  publication-title: Oper. Res.
  doi: 10.1287/opre.18.1.24
– volume: 48
  start-page: 595
  year: 2010
  ident: R26
  publication-title: J. Global Optim.
  doi: 10.1007/s10898-009-9507-y
– ident: R27
  doi: 10.1117/12.2558832
– ident: R2
– volume: 119
  start-page: 662
  year: 1999
  ident: R19
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/S0377-2217(98)00359-2
– volume: 220
  start-page: 671
  year: 1983
  ident: R17
  publication-title: Science
  doi: 10.1126/science.220.4598.671
– ident: R4
SSID ssib051866905
ssib051327486
ssj0003353
ssib050921426
Score 2.3155541
Snippet This paper addresses the unconstrained binary quadratic problem (UQP). This problem consists in minimizing a quadratic function a binary variables (0 − 1...
SourceID crossref
SourceType Index Database
StartPage 3241
Title New approach to solve unconstrained binary quadratic problem
Volume 58
WOSCitedRecordID wos001288586300004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2804-7303
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib051866905
  issn: 0399-0559
  databaseCode: M~E
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWwgEOiKegPGQJblXSTfyII3FZoVZwoKBVkcppZSeOumqVLEl21VN_AL-acWwn5nEoBw6Jst7dRMl8GX_2eL5B6C28ZCqppIgqVVURMGIeCZbTiAtZaHhDRCHLodhEdnIizs7yL7PZD58Ls7vM6lpcXeWb_2pqaANjm9TZfzD3eFJogGMwOuzB7LC_keHNikWvFG6YJVxtpw-g-zJM0BSEMJzTZuF-38qyHSRbXV2ZkKou40X8MV7Gn2PDLcG0sB00GxtZt7gxS2RGYCylWp_bEEbfry_OJ9_WdXaWdXFpKpdty2n2tOu0zdJeTxMDi9KVTP4GX_uov5uXSOm4hnXMxzL6BszpfeuhLRVzGoFPIaH_ZSLAGQ2cKXC9JOiYgWimf3X64FfAKCYt6DgdJNuyqXPzAf3f-rxxJeIQg2fJqm1W7r-30O00Y7nxkJ-uj7xvAl5lxOlG6sZgFJ9REXwWnOfzaehFiFVA9U_BS-Oy5LBtDt21AjIUsJrTB-i-G47ghYXRQzTT9SN0LxCpfIzeAaCwBxTuGzwACv8CKGwBhUdAYQeoJ-jr8dHp-w-Rq7kRFTCy7aNEFlTmCkijicgxWTFCyzlRqdIyKSgvUwIMpsgrUWVGmpFqKTmZA6kGXqMFJ0_RXt3U-hnCXKWkoEwSCRSQ60olVHEBp5NCSpWI5-iNv_nVxkqrrP40x_6NfvUC3Z0w-BLt9e1Wv0J3il2_7trXgyV_AmETZ0U
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=New+approach+to+solve+unconstrained+binary+quadratic+problem&rft.jtitle=R.A.I.R.O.+Recherche+op%C3%A9rationnelle&rft.au=Rabih%2C+Battikh&rft.au=Hassan%2C+Alabboud&rft.au=Bassem%2C+Jida&rft.au=Adnan%2C+Yassine&rft.date=2024-07-01&rft.issn=0399-0559&rft.eissn=2804-7303&rft.volume=58&rft.issue=4&rft.spage=3241&rft.epage=3262&rft_id=info:doi/10.1051%2Fro%2F2024087&rft.externalDBID=n%2Fa&rft.externalDocID=10_1051_ro_2024087
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0399-0559&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0399-0559&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0399-0559&client=summon