{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T17:31:16Z","timestamp":1781803876208,"version":"3.54.5"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031629112","type":"print"},{"value":"9783031629129","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-62912-9_24","type":"book-chapter","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:01:37Z","timestamp":1718550097000},"page":"246-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving Edge-Weighted Maximum Clique Problem with\u00a0DCA Warm-Start Quantum Approximate Optimization Algorithm"],"prefix":"10.1007","author":[{"given":"Huy Phuc Nguyen","family":"Ha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Viet Hung","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anh Son","family":"Ta","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"24_CR1","unstructured":"Gloria, T., Dacrema, M.F., Cremonesi, P.: Feature selection for classification with QAOA. In: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE (2022)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"491","DOI":"10.22331\/q-2021-07-01-491","volume":"5","author":"SH Sack","year":"2021","unstructured":"Sack, S.H., Serbyn, M.: Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum 5, 491 (2021)","journal-title":"Quantum"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"999","DOI":"10.22331\/q-2023-05-11-999","volume":"7","author":"A Anshu","year":"2023","unstructured":"Anshu, A., Metger, T.: Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations. Quantum 7, 999 (2023)","journal-title":"Quantum"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Lucas, A.: Ising formulations of many np problems. Front. Phys. 5 (2014)","DOI":"10.3389\/fphy.2014.00005"},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.22331\/q-2020-04-20-256","volume":"4","author":"PK Barkoutsos","year":"2020","unstructured":"Barkoutsos, P.K., et al.: Improving variational quantum optimization using CVaR. Quantum 4, 256 (2020)","journal-title":"Quantum"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"110296","DOI":"10.1016\/j.asoc.2023.110296","volume":"142","author":"G Acampora","year":"2023","unstructured":"Acampora, G., Chiatto, A., Vitiello, A.: Genetic algorithms as classical optimizer for the quantum approximate optimization algorithm. Appl. Soft Comput. 142, 110296 (2023)","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"24_CR7","doi-asserted-by":"publisher","first-page":"012320","DOI":"10.1103\/PhysRevA.101.012320","volume":"101","author":"Z Wang","year":"2020","unstructured":"Wang, Z., et al.: X y mixers: analytical and numerical results for the quantum alternating operator ansatz. Phys. RevA 101(1), 012320 (2020)","journal-title":"Phys. RevA"},{"key":"24_CR8","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algo- rithm. arXiv preprint arXiv:1411.4028 (2014)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"479","DOI":"10.22331\/q-2021-06-17-479","volume":"5","author":"DJ Egger","year":"2021","unstructured":"Egger, D.J., Marecek, J., Woerner, S.: Warm-starting quantum optimization. Quantum 5, 479 (2021)","journal-title":"Quantum"},{"issue":"12","key":"24_CR10","doi-asserted-by":"publisher","first-page":"120502","DOI":"10.1103\/PhysRevLett.127.120502","volume":"127","author":"L Bittel","year":"2021","unstructured":"Bittel, L., Kliesch, M.: Training variational quantum algorithms is np-hard. Phys. Rev. Lett. 127(12), 120502 (2021)","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"24_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"LTH An","year":"2005","unstructured":"An, L.T.H., Tao, P.D.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world non convex optimization problems. Ann. Oper. Res. 133(2), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"PD Tao","year":"1998","unstructured":"Tao, P.D., An, L.T.H.: A DC optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"24_CR13","first-page":"215","volume":"318","author":"LT Hoai An","year":"2018","unstructured":"Hoai An, L.T., Ta, A.S., Tao, P.D.: An efficient DCA based algorithm for power control in large scale wireless networks. Appl. Math. Comput. 318(1), 215\u2013226 (2018)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s11128-022-03766-5","volume":"22","author":"S Brandhofer","year":"2022","unstructured":"Brandhofer, S., et al.: Benchmarking the performance of portfolio optimization with QAOA. Quantum Inf. Process. 22(1), 25 (2022)","journal-title":"Quantum Inf. Process."},{"issue":"6\u20137","key":"24_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0898-1221(91)90163-X","volume":"21","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M.: Global optimization algorithms for linearly constrained indefinite quadratic problems. Comput. Math. Appl. 21(6\u20137), 87\u201397 (1991)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1008240227198","volume":"13","author":"LTH An","year":"1998","unstructured":"An, L.T.H., Tao, P.D.: A branch and bound method via DC optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. J. Global Optim. 13(2), 171\u2013206 (1998)","journal-title":"J. Global Optim."},{"issue":"2","key":"24_CR17","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.ejor.2023.03.013","volume":"310","author":"K Kurowski","year":"2023","unstructured":"Kurowski, K., Pecyna, T., Slysz, M., Rozycki, R., Waligora, G., Wglarz, J.: Application of quantum approximate optimization algorithm to job shop scheduling problem. Eur. J. Oper. Res. 310(2), 518\u2013528 (2023)","journal-title":"Eur. J. Oper. Res."},{"issue":"20","key":"24_CR18","doi-asserted-by":"publisher","first-page":"7116","DOI":"10.3390\/app10207116","volume":"10","author":"J Choi","year":"2020","unstructured":"Choi, J., Oh, S., Kim, J.: Quantum approximation for wireless scheduling. Appl. Sci. 10(20), 7116 (2020)","journal-title":"Appl. Sci."},{"issue":"9","key":"24_CR19","doi-asserted-by":"publisher","first-page":"094202","DOI":"10.1103\/PhysRevB.107.094202","volume":"107","author":"P Torta","year":"2023","unstructured":"Torta, P., Mbeng, G.B., Baldassi, C., Zecchina, R., Santoro, G.E.: Quantum approximate optimization algorithm applied to the binary perceptron. Phys. Rev. B 107(9), 094202 (2023)","journal-title":"Phys. Rev. B"},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"861","DOI":"10.22331\/q-2022-11-17-861","volume":"6","author":"N Jain","year":"2022","unstructured":"Jain, N., Coyle, B., Kashefi, E., Kumar, N.: Graph neural network initialisation of quantum approximate optimisation. Quantum 6, 861 (2022)","journal-title":"Quantum"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Shaydulin, R., Safro, I., Larson, J.: Multistart methods for quantum approximate optimization. In: 2019 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20138. IEEE (2019)","DOI":"10.1109\/HPEC.2019.8916288"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Hadfield, S., Wang, Z., O\u2019gorman, B., Rieffel, E.G., Venturelli, D., Biswas, R.: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12(2), 34 (2019)","DOI":"10.3390\/a12020034"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Grange, C., Poss, M., Bourreau, E.: An introduction to variational quantum algorithms for combinatorial optimization problems. 4OR, 21(3), 363\u2013403 (2023)","DOI":"10.1007\/s10288-023-00549-1"},{"key":"24_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10898-018-0630-5","volume":"72","author":"S Hosseinian","year":"2018","unstructured":"Hosseinian, S., Fontes, D.B.M.M., Butenko, S.: A nonconvex quadratic optimization approach to the maximum edge weight clique problem. J. Global Optim. 72, 219\u2013240 (2018)","journal-title":"J. Global Optim."},{"issue":"3","key":"24_CR25","doi-asserted-by":"publisher","first-page":"1867","DOI":"10.1137\/120878495","volume":"23","author":"C Buchheim","year":"2013","unstructured":"Buchheim, C., et al.: An exact algorithm for nonconvex quadratic integer minimization using ellipsoidal relaxations. SIAM J. Optim. 23(3), 1867\u20131889 (2013)","journal-title":"SIAM J. Optim."},{"key":"24_CR26","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10898-009-9507-y","volume":"48","author":"T Pham Dinh","year":"2010","unstructured":"Pham Dinh, T., Nguyen Canh, N., Le Thi, H.A.: An efficient combined DCA and B &B using DC\/SDP relaxation for globally solving binary quadratic programs. J. Global Optim. 48, 595\u2013632 (2010)","journal-title":"J. Global Optim."},{"issue":"1","key":"24_CR27","first-page":"87","volume":"8","author":"AS Ta","year":"2011","unstructured":"Ta, A.S., Khadraoui, D., Tao, P.D., et al.: Solving partitioning-hub location- routing problem using DCA. J. Ind. Manag. Optim. 8(1), 87\u2013102 (2011)","journal-title":"J. Ind. Manag. Optim."},{"issue":"2","key":"24_CR28","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s42979-020-00437-z","volume":"2","author":"FG Fuchs","year":"2021","unstructured":"Fuchs, F.G., Kolden, H.\u00d8., Aase, N.H., Sartor, G.: Efficient encoding of the weighted max k-cut on a quantum computer using QAOA. SN Comput. Sci. 2(2), 89 (2021)","journal-title":"SN Comput. Sci."},{"issue":"5","key":"24_CR29","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse Ising model. Phys. Rev. E 58(5), 5355 (1998)","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-62912-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:11:41Z","timestamp":1718550701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62912-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629112","9783031629129"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62912-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lorient","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mic2024.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}