{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:57:56Z","timestamp":1743109076731,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031653421"},{"type":"electronic","value":"9783031653438"}],"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-65343-8_16","type":"book-chapter","created":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T15:03:47Z","timestamp":1722265427000},"page":"244-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving Maximum Cut Problem with\u00a0Multi-objective Enhance Quantum Approximate Optimization Algorithm"],"prefix":"10.1007","author":[{"given":"Huy Phuc Nguyen","family":"Ha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viet Hung","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anh Son","family":"Ta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,30]]},"reference":[{"issue":"4","key":"16_CR1","doi-asserted-by":"publisher","first-page":"045009","DOI":"10.1088\/2058-9565\/ace474","volume":"8","author":"P D\u00edez-valle","year":"2023","unstructured":"D\u00edez-valle, P., et al.: Multiobjective variational quantum optimization for constrained problems: an application to cash handling. Quant. Sci. Technol. 8(4), 045009 (2023)","journal-title":"Quant. Sci. Technol."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Turati, G., Dacrema, M.F., Cremonesi, P.: Feature selection for classification with QAOA. In: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE (2022)","DOI":"10.1109\/QCE53715.2022.00117"},{"key":"16_CR3","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"},{"issue":"4\u20135","key":"16_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1080\/10556780500139641","volume":"20","author":"B Balasundaram","year":"2005","unstructured":"Balasundaram, B., Butenko, S.: Constructing test functions for global optimization using continuous formulations of graph problems. Optim. Methods Softw. 20(4\u20135), 439\u2013452 (2005)","journal-title":"Optim. Methods Softw."},{"issue":"9","key":"16_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s11128-021-03232-8","volume":"20","author":"R Herrman","year":"2021","unstructured":"Herrman, R., et al.: Impact of graph structures for QAOA on MaxCut. Quant. Inf. Process. 20(9), 289 (2021)","journal-title":"Quant. Inf. Process."},{"key":"16_CR6","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":"16_CR7","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":"16_CR8","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. Rev. A 101(1), 012320 (2020)","journal-title":"Phys. Rev. A"},{"key":"16_CR9","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algo- rithm. arXiv preprint arXiv:1411.4028 (2014)"},{"key":"16_CR10","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., Mare\u010dek, J., Woerner, S.: Warm-starting quantum optimization. Quantum 5, 479 (2021)","journal-title":"Quantum"},{"issue":"12","key":"16_CR11","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."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"532","DOI":"10.22331\/q-2021-08-30-532","volume":"5","author":"V Akshay","year":"2021","unstructured":"Akshay, V., Philathong, H., Zacharov, I., Biamonte, J.: Reachability deficits in quantum approximate optimization of graph problems. Quantum 5, 532 (2021)","journal-title":"Quantum"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"013304","DOI":"10.1103\/PhysRevE.99.013304","volume":"99","author":"G Nannicini","year":"2019","unstructured":"Nannicini, G.: Performance of hybrid quantum-classical variational heuristics for combinatorial optimization. Phys. Rev. E 99(1), 013304 (2019)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/S00361445024180","volume":"45","author":"C Moler","year":"2003","unstructured":"Moler, C., Van Loan, C.: Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM Rev. 45(1), 3\u201349 (2003)","journal-title":"SIAM Rev."},{"issue":"2","key":"16_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"D Kalyanmoy","year":"2002","unstructured":"Kalyanmoy, D., et al.: A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2024 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-65343-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,29]],"date-time":"2024-07-29T15:06:25Z","timestamp":1722265585000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-65343-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031653421","9783031653438"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-65343-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"30 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","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":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}