{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T00:24:02Z","timestamp":1723249442532},"reference-count":29,"publisher":"EDP Sciences","issue":"4","license":[{"start":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T00:00:00Z","timestamp":1723075200000},"content-version":"vor","delay-in-days":38,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2024,4,16]]},"published-print":{"date-parts":[[2024,7]]},"abstract":"<jats:p>This paper addresses the unconstrained binary quadratic problem (UQP). This problem consists in minimizing a quadratic function a binary variables (0<jats:italic>\u2212<\/jats:italic>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.<\/jats:p>","DOI":"10.1051\/ro\/2024087","type":"journal-article","created":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T12:00:46Z","timestamp":1713441646000},"page":"3241-3262","source":"Crossref","is-referenced-by-count":0,"title":["New approach to solve unconstrained binary quadratic problem"],"prefix":"10.1051","volume":"58","author":[{"given":"Battikh","family":"Rabih","sequence":"first","affiliation":[]},{"given":"Alabboud","family":"Hassan","sequence":"additional","affiliation":[]},{"given":"Jida","family":"Bassem","sequence":"additional","affiliation":[]},{"given":"Yassine","family":"Adnan","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2024,8,8]]},"reference":[{"key":"R1","unstructured":"http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html."},{"key":"R2","unstructured":"Alabboud H., La programmation semi-d\u00e9finie combin\u00e9e et compar\u00e9e avec d\u2019autres probl\u00e8mes d\u2019optimisation. Th\u00e8se de doctorat, Universit\u00e9 de Havre (2007)."},{"key":"R3","doi-asserted-by":"crossref","first-page":"3241","DOI":"10.1088\/0305-4470\/15\/10\/028","volume":"15","author":"Barahona","year":"1982","journal-title":"J. Phys. A: Math. General"},{"key":"R4","unstructured":"Benson S.J. and Ye Y., DSDP5: software for semidefinite programming. Technical Report ANL\/MCS-P1289-0905, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (2005). Submitted to ACM Transactions on Mathematical Software."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Benson S.J. and Ye Y., DSDP5 User guide \u2013 software for semidefinite programming. Technical Report ANL\/MCS-TM-277, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL (2005). http:\/\/www.mcs.anl.gov\/benson\/dsdp.","DOI":"10.2172\/947970"},{"key":"R6","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S1052623497328008","volume":"10","author":"Benson","year":"2000","journal-title":"SIAM J. Optim."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Brand M., Masuda M., Wehner N. and Yu X.-H., Ant colony optimization algorithm for robot path planning, in 2010 International Conference on Computer Design and Applications. Vol. 3. IEEE (2010) V3-436.","DOI":"10.1109\/ICCDA.2010.5541300"},{"key":"R8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"\u010cern`y","year":"1985","journal-title":"J. Optim. Theory App."},{"key":"R9","doi-asserted-by":"crossref","unstructured":"Clark J., West T., Zammit J., Guo X., Mason L. and Russell D., Towards real time multi-robot routing using quantum computing technologies, in Proceedings of the International Conference on High Performance Computing in Asia-Pacific Region (2019) 111\u2013119.","DOI":"10.1145\/3293320.3293333"},{"key":"R10","unstructured":"Cohen J., Khan A. and Alexander C., Portfolio optimization of 60 stocks using classical and quantum algorithms. Preprint arXiv:2008.08669 (2020)."},{"key":"R11","doi-asserted-by":"crossref","first-page":"2013","DOI":"10.2514\/3.10834","volume":"29","author":"Deb","year":"1991","journal-title":"AIAA J."},{"key":"R12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.14419\/ijet.v9i1.29918","volume":"9","author":"El Chakik","year":"2020","journal-title":"Int. J. Eng. Technol."},{"key":"R13","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/mnsc.44.3.336","volume":"44","author":"Glover","year":"1998","journal-title":"Manage. Sci."},{"key":"R14","unstructured":"Glover F., Kochenberger G., Ma M. and Du Y., Quantum bridge analytics II: network optimization and combinatorial chaining for asset exchange. Preprint arXiv:1911.03036 (2019)."},{"key":"R15","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1006\/jpdc.1996.0121","volume":"37","author":"Ram","year":"1996","journal-title":"J. Parallel Distrib. Comput."},{"key":"R16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ro\/2018095","volume":"54","author":"Khorbatly","year":"2020","journal-title":"RAIRO-Oper. Res."},{"key":"R17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"R18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"Laporte","year":"2000","journal-title":"Int. Trans. Oper. Res."},{"key":"R19","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"Lodi","year":"1999","journal-title":"Eur. J. Oper. Res."},{"key":"R20","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"Metropolis","year":"1953","journal-title":"J. Chem. Phys."},{"key":"R21","first-page":"2004","volume":"32","author":"Misevi\u010dius","year":"2004","journal-title":"Inf. Technol. Control"},{"key":"R22","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/opre.18.1.24","volume":"18","author":"Mitten","year":"1970","journal-title":"Oper. Res."},{"key":"R23","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"Morrison","year":"2016","journal-title":"Discrete Optim."},{"key":"R24","doi-asserted-by":"crossref","first-page":"e0227538","DOI":"10.1371\/journal.pone.0227538","volume":"15","author":"Negre","year":"2020","journal-title":"Plos One"},{"key":"R25","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(92)90043-3","volume":"11","author":"Pardalos","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"R26","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10898-009-9507-y","volume":"48","author":"Dinh","year":"2010","journal-title":"J. Global Optim."},{"key":"R27","doi-asserted-by":"crossref","unstructured":"Sleeman J., Dorband J. and Halem M., A hybrid quantum enabled RBM advantage: convolutional autoencoders for quantum image compression and generative learning, in Quantum Information Science, Sensing, and Computation XII. Vol. 11391. SPIE (2020) 23\u201338.","DOI":"10.1117\/12.2558832"},{"key":"R28","doi-asserted-by":"crossref","first-page":"107006","DOI":"10.1016\/j.cpc.2019.107006","volume":"248","author":"Willsch","year":"2020","journal-title":"Comput. Phys. Commun."},{"key":"R29","doi-asserted-by":"crossref","unstructured":"Wolkowicz H., Saigal R. and Vandenberghe L., Handbook of Semidefinite Programming. International Series in Operations Research & Management Science. Vol. 27. Kluwer Academic Publishers, Boston (2000).","DOI":"10.1007\/978-1-4615-4381-7"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024087\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T12:04:12Z","timestamp":1723205052000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2024087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":29,"journal-issue":{"issue":"4"},"alternative-id":["ro230357"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2024087","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2024,7]]}}}