{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:14:36Z","timestamp":1775470476996,"version":"3.50.1"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030617042","type":"print"},{"value":"9783030617059","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61705-9_21","type":"book-chapter","created":{"date-parts":[[2020,11,4]],"date-time":"2020-11-04T16:03:54Z","timestamp":1604505834000},"page":"245-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Using the Variational-Quantum-Eigensolver (VQE) to Create an Intelligent Social Workers Schedule Problem Solver"],"prefix":"10.1007","author":[{"given":"Parfait","family":"Atchade Adelomou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisabet","family":"Golobardes Rib\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Vilas\u00eds Cardona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,4]]},"reference":[{"key":"21_CR1","unstructured":"Bovet, D., Crescenzi, P.: Introduction to the Theory of Complexity, p. 69, xi, 282. Prentice-Hall, New York (1994). ISBN 0-13-915380-2"},{"key":"21_CR2","series-title":"LNE","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-95322-4_5","volume-title":"Optimization and Operations Research","author":"P Brucker","year":"1978","unstructured":"Brucker, P.: On the complexity of clustering problems. In: Henn, R., Korte, B., Oettli, W. (eds.) Optimization and Operations Research. LNE, vol. 157, pp. 45\u201354. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/978-3-642-95322-4_5"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bo\u017cejko, W., Pempera, J., Smutnicki, C.: Parallel simulated annealing for the Job Shop Scheduling problem. In: Biological Cybernetics: International Conference on Computational, vol. 60, pp. 139\u2013144 (2009)","DOI":"10.1007\/978-3-642-01970-8_62"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithm. Eur. J. Oper. Res. 59, 345\u2013358 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The Vehicle Routing Problem: SIAM Monographs on Discrete Mathematics and Applications. SIAM (2002)","DOI":"10.1137\/1.9780898718515"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"21_CR8","unstructured":"de Wolf, R.: QuSoft, CWI and University of Amsterdam: Lecture Notes. Quantum Computing https:\/\/arxiv.org\/abs\/1907.09415 (2019)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"140504","DOI":"10.1103\/PhysRevLett.122.140504","volume":"122","author":"D Wang","year":"2019","unstructured":"Wang, D., Higgott, O., Brierley, S.: Accelerated variational quantum eigensolver. Phys. Rev. Lett. 122, 140504 (2019)","journal-title":"Phys. Rev. Lett."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G Desaulniers","year":"2008","unstructured":"Desaulniers, G., Lessard, F., Hadjar, A.: Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle rerouting problem with time windows. Transp. Sci. 42, 387\u2013404 (2008)","journal-title":"Transp. Sci."},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/B:ANOR.0000032576.73681.29","volume":"130","author":"L-M Rousseau","year":"2004","unstructured":"Rousseau, L.-M., Gendreau, M., Pesant, G.: Solving VRPTWs with constraint programming-based column generation. Ann. Oper. Res. 130, 199\u2013216 (2004)","journal-title":"Ann. Oper. Res."},{"key":"21_CR12","unstructured":"Docplex. https:\/\/cdn.rawgit.com\/IBMDecisionOptimization\/docplex-doc\/master\/docs\/index.html . Access 16 Mar 2020"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1088\/0305-4470\/14\/1\/024","volume":"14","author":"CJ Hamer","year":"1981","unstructured":"Hamer, C.J., Barber, M.N.: Finite-lattice methods in quantum Hamiltonian field theory. I. The Ising model. J. Phys. A Math. Gen. 14, 241 (1981)","journal-title":"J. Phys. A Math. Gen."},{"key":"21_CR14","first-page":"111","volume":"60","author":"M Schuld","year":"2019","unstructured":"Schuld, M., Killoran, N.: Probability distributions and hilbert spaces: quantum and classical systems. Phys. Rev. Lett. 60, 111 (2019)","journal-title":"Phys. Rev. Lett."},{"key":"21_CR15","unstructured":"Parra-Rodriguez, A., Lougovski, P., Lamata, L., Solano, E., Sanz, M.: Digital-Analog Quantum Computation (2018)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574, 505\u2013510 (2019)","journal-title":"Nature"},{"key":"21_CR17","unstructured":"Roub\u00ed\u010dek, T.: Relaxation in optimization theory and variational calculus (2011)"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/0022-247X(74)90025-0","volume":"47","author":"I Ekeland","year":"1974","unstructured":"Ekeland, I.: On the variational principle. J. Math. Anal. Appl. 47, 324\u2013353 (1974)","journal-title":"J. Math. Anal. Appl."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.1080\/01621459.2012.737745","volume":"170","author":"R Killick","year":"2012","unstructured":"Killick, R., Fearnhead, P., Eckley, I.A.: Optimal detection of changepoints with a linear computational cost. J. Am. Stat. Assoc. 170, 1590\u20131598 (2012)","journal-title":"J. Am. Stat. Assoc."},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1287\/opre.50.1.48.17791","volume":"50","author":"S Dreyfus","year":"2002","unstructured":"Dreyfus, S.: Richard Bellman on the birth of dynamic programming. Oper. Res. 50, 48\u201351 (2002)","journal-title":"Oper. Res."},{"key":"21_CR21","first-page":"7","volume":"4","author":"B Bhowmik","year":"2010","unstructured":"Bhowmik, B.: Dynamic programming. Its principles, applications, strengths, and limitations. Criterion 4, 7 (2010)","journal-title":"Criterion"},{"key":"21_CR22","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0096-3003(98)00004-6","volume":"99","author":"RP Agarwal","year":"1999","unstructured":"Agarwal, R.P., Bohner, M., Wong, P.J.Y.: Sturm-Liouville eigenvalue problems on time scales. Appl. Math. Comput. 99, 153\u2013166 (1999)","journal-title":"Appl. Math. Comput."},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/S0022-460X(85)80109-7","volume":"102","author":"RB Bhat","year":"1985","unstructured":"Bhat, R.B.: Natural frequencies of rectangular plates using characteristic orthogonal polynomials in Rayleigh-Ritz method. J. Sound Vibr. 102, 493\u2013499 (1985)","journal-title":"J. Sound Vibr."},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Eisberg, R.: Quantum Physics of Atoms, Molecules, Solids, Nuclei, and Particles (1985)","DOI":"10.1063\/1.2814935"},{"key":"21_CR25","doi-asserted-by":"publisher","unstructured":"Lucas, A.: Ising formulations of many NP problems. Front. Phys. 2, 1\u20135 (2014). https:\/\/doi.org\/10.3389\/fphy.2014.00005","DOI":"10.3389\/fphy.2014.00005"},{"key":"21_CR26","unstructured":"Alonso Mendoza Su\u00e1rez, L.J., Gonzalez Sierra, H., Segovia-Chaves, F.: Explicit derivation of the Pauli spin matrices from the Jones vector (2019)"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"Varizi1, A.D., Drumond, R.C.: Quantum Ising model in a period-2 modulated transverse field. https:\/\/arxiv.org\/abs\/1903.09468 (2019)","DOI":"10.1103\/PhysRevE.100.022104"},{"key":"21_CR28","first-page":"1","volume":"33","author":"BA Cipra","year":"2000","unstructured":"Cipra, B.A.: The Ising model is NP-complete. SIAM News 33, 1\u20133 (2000)","journal-title":"SIAM News"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)","journal-title":"Quantum"},{"key":"21_CR30","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1038\/nature23474","volume":"549","author":"J Biamonte","year":"2017","unstructured":"Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P.: Quantum machine learning. Nature 549, 195\u2013202 (2017)","journal-title":"Nature"},{"key":"21_CR31","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.laa.2004.12.014","volume":"402","author":"CW Wu","year":"2005","unstructured":"Wu, C.W.: On Rayleigh-Ritz ratios of a generalized Laplacian matrix of directed graphs. Linear Algebra Appl. 402, 207\u2013227 (2005)","journal-title":"Linear Algebra Appl."},{"key":"21_CR32","first-page":"1365","volume":"6","author":"N Raychev","year":"2015","unstructured":"Raychev, N.: Quantum circuit for spatial optimization. Int. J. Sci. Eng. 6, 1365\u20131368 (2015)","journal-title":"Int. J. Sci. Eng."},{"key":"21_CR33","unstructured":"Steeb, W.-H., Hardy, Y.: Matrix Calculus and Kronecker Product: A Practical Approach to Linear and Multilinear Algebra (2019)"},{"key":"21_CR34","doi-asserted-by":"publisher","unstructured":"Macedo, H.D., Oliveira, J.N.: Typing Linear Algebra: A Biproduct-Oriented Approach. https:\/\/doi.org\/10.1016\/j.scico.2012.07.012 . Accessed 16 Mar 2020","DOI":"10.1016\/j.scico.2012.07.012"},{"key":"21_CR35","unstructured":"Farhi, E., Harrow, A.W.: Quantum supremacy through the quantum approximate optimization algorithm (2016)"},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"Guerreschi, G.G., Matsuura, A.Y.: Scientific reports QAOA for Max-Cut requires hundreds of qubits for quantum speed-up (2019)","DOI":"10.1038\/s41598-019-43176-9"},{"key":"21_CR37","doi-asserted-by":"crossref","unstructured":"Moylett, D.J., Linden, N., Montanaro, A.: Quantum speedup of the Travelling Salesman Problem for bounded-degree graphs (2016)","DOI":"10.1103\/PhysRevA.95.032323"},{"key":"21_CR38","doi-asserted-by":"publisher","unstructured":"Preskill, J.: Quantum Computing in the NISQ era and beyond. https:\/\/doi.org\/10.22331\/q-2018-08-06-79 . Accessed 16 Mar 2020","DOI":"10.22331\/q-2018-08-06-79"},{"key":"21_CR39","unstructured":"ADA. https:\/\/qiskit.org\/documentation\/api\/qiskit.aqua.QuantumInstance.html . Accessed 16 Mar 2020"},{"key":"21_CR40","unstructured":"Wang, X., Truong, V.A., Bank, D.: Online Advance Admission Scheduling for Services with Customer Preferences. Technical report, Columbia University, New York, NY (2018)"},{"key":"21_CR41","unstructured":"Stephani, V.: Effective and needed, but not used: why do mobile phone-based health interventions in Africa not move beyond the project status? (2019)"},{"key":"21_CR42","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.future.2018.03.052","volume":"86","author":"AH Sodhro","year":"2018","unstructured":"Sodhro, A.H., Pirbhulal, S., Sangaiah, A.K.: Convergence of IoT and product lifecycle management in medical health care. Future Gener. Comput. Syst. 86, 380\u2013391 (2018)","journal-title":"Future Gener. Comput. Syst."},{"key":"21_CR43","unstructured":"Al Isma\u2019ili, S., Li, M., Shen, J., He, Q., Alghazi, A.: African Societal Challenges Transformation through IoT (2017)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61705-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T12:51:31Z","timestamp":1698324691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61705-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617042","9783030617059"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61705-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Hybrid Artificial Intelligence Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gij\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hais2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2020.haisconference.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"106","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"65","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}