{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:08:25Z","timestamp":1764688105338,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031629112"},{"type":"electronic","value":"9783031629129"}],"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_26","type":"book-chapter","created":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:01:37Z","timestamp":1718550097000},"page":"268-280","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving Quadratic Knapsack Problem with\u00a0Biased Quantum State 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,6,17]]},"reference":[{"issue":"04","key":"26_CR1","doi-asserted-by":"publisher","first-page":"2050011","DOI":"10.1142\/S0219749920500112","volume":"18","author":"ZH Saleem","year":"2020","unstructured":"Saleem, Z.H.: Max-independent set and the quantum alternating operator ansatz. Int. J. Quantum Inf. 18(04), 2050011 (2020)","journal-title":"Int. J. Quantum Inf."},{"key":"26_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2023.129089","volume":"626","author":"S-S Wang","year":"2023","unstructured":"Wang, S.-S., Liu, H.-L., Song, Y.-Q., Gao, F., Qin, S.-J., Wen, Q.-Y.: Quantum alternating operator ansatz for solving the minimum exact cover problem. Phys. A 626, 129089 (2023)","journal-title":"Phys. A"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Sack, S.H., Serbyn, M.: Quantum annealing initialization of the quantum approximate optimization algorithm. Quantum 5, 491 (2021). 11","DOI":"10.22331\/q-2021-07-01-491"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ac3e54","volume":"7","author":"D Amaro","year":"2022","unstructured":"Amaro, D., Modica, C., Rosenkranz, M., Fiorentini, M., Benedetti, M., Lubasch, M.: Filtering variational quantum algorithms for combinatorial optimization. Quantum Sci. Technol. 7(1), 015021 (2022)","journal-title":"Quantum Sci. Technol."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Hao, T., Shaydulin, R., Pistoia, M., Larson, J.: Exploiting in-constraint energy in constrained variational quantum optimization. In: 2022 IEEE\/ACM Third International Workshop on Quantum Computing Software (QCS), pp. 100\u2013106. IEEE (2022)","DOI":"10.1109\/QCS56647.2022.00017"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Barkoutsos, P.K.l., et al.: Improving variational quantum optimization using CVaR. Quantum 4, 256 (2020)","DOI":"10.22331\/q-2020-04-20-256"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Acampora, G., Chiatto, A., Vitiello, A.: Genetic algorithms as classical optimizer for the quantum approximate optimization algorithm. Appl. Soft Comput. 142, 110296 (2023)","DOI":"10.1016\/j.asoc.2023.110296"},{"key":"26_CR8","doi-asserted-by":"crossref","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)","DOI":"10.1103\/PhysRevA.101.012320"},{"key":"26_CR9","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algo rithm. arXiv preprint arXiv:1411.4028 (2014)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Egger, D. J., Marecek, J., Woerner, S.: Warm-starting quantum optimization. Quantum 5, 479 (2021)","DOI":"10.22331\/q-2021-06-17-479"},{"issue":"12","key":"26_CR11","doi-asserted-by":"publisher","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":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1140\/epjqt\/s40507-022-00123-4","volume":"9","author":"D Amaro","year":"2022","unstructured":"Amaro, D., Rosenkranz, M., Fitzpatrick, N., Hirano, K., Fiorentini, M.: A case study of variational quantum algorithms for a job shop scheduling problem. EPJ Quantum Technol. 9(1), 5 (2022)","journal-title":"EPJ Quantum Technol."},{"issue":"1","key":"26_CR13","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."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Punnen, A.P., Pandey, P., Friesen, M.: Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems. Comput. Oper. Res. 112, 104769 (2019). 9","DOI":"10.1016\/j.cor.2019.104769"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Hadfield, S., et al.: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12(2), 34 (2019)","DOI":"10.3390\/a12020034"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Bartschi, A., Eidenbenz, S.: Grover mixers for QAOA: shifting complexity from mixer design to state preparation. In: 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 72\u201382. IEEE (2020)","DOI":"10.1109\/QCE49297.2020.00020"},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"Fomeni, F.D., Kaparis, K., Letchford, A.N.: A cut-and-branch algorithm for the quadratic knapsack problem. Discret. Optim. 44, 100579 (2022)","DOI":"10.1016\/j.disopt.2020.100579"},{"key":"26_CR18","doi-asserted-by":"publisher","unstructured":"Kellerer, H., et al.: Multidimensional Knapsack Problems. In: Knapsack Problems. Springer, Berlin, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7_9","DOI":"10.1007\/978-3-540-24777-7_9"},{"issue":"5","key":"26_CR19","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem-a survey. Discret. Appl. Math. 155(5), 623\u2013648 (2007)","journal-title":"Discret. Appl. Math."}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,16]],"date-time":"2024-06-16T15:11:51Z","timestamp":1718550711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-62912-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031629112","9783031629129"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-62912-9_26","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":"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"}}]}}