{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:21:51Z","timestamp":1767183711657,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876557"},{"type":"electronic","value":"9783540876564"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87656-4_22","type":"book-chapter","created":{"date-parts":[[2009,1,7]],"date-time":"2009-01-07T18:56:17Z","timestamp":1231354577000},"page":"172-179","source":"Crossref","is-referenced-by-count":8,"title":["A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem"],"prefix":"10.1007","author":[{"given":"Abdesslem","family":"Layeb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Djamel-Eddine","family":"Saidouni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The Complexity of Theorem Proving Procedures. In: Proc. 3rd Ann. ACM Symp. On Theory of Computing, Association for Computing Machinery, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"22_CR2","unstructured":"Alsinet, T., Manya, F., Planes, J.: Improved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT. In: Proceedings of Sixth Catalan Conference on Artificial Intelligence (CCIA 2003) (October 2003)"},{"key":"22_CR3","unstructured":"Marchiori, E., Rossi, C.: A Flipping Genetic Algorithm for Hard 3-SAT Problems. In: Proc. of the Genetic and Evolutionary Computation Conference, vol.\u00a01, pp. 393\u2013400 (1999)"},{"issue":"5","key":"22_CR4","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers\u00a048(5), 506\u2013521 (1999)","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H. Holger","year":"2000","unstructured":"Holger, H., St\u00fctzle, T.: Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning\u00a024(4), 421\u2013481 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"22_CR6","volume-title":"Explorations in quantum computing","author":"C.P. Williams","year":"1998","unstructured":"Williams, C.P., Clearwater, S.H.: Explorations in quantum computing. Springer, Berlin (1998)"},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/TEVC.2004.823467","volume":"8","author":"K.H. Han","year":"2004","unstructured":"Han, K.H., Kim, J.H.: Quantum-inspired Evolutionary Algorithms with a New Termination Criterion, H\u03b5 Gate, and Two Phase Scheme. IEEE Transactions on Evolutionary Computation\u00a08(2), 156\u2013169 (2004)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"9","key":"22_CR8","first-page":"130","volume":"7","author":"A. Layeb","year":"2007","unstructured":"Layeb, A., Saidouni, D.E.: Quantum Genetic Algorithm for Binary Decision Diagram Ordering Problem. The proceeding of International Journal of Computer Science and Network Security\u00a07(9), 130\u2013135 (2007)","journal-title":"The proceeding of International Journal of Computer Science and Network Security"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Layeb, A., Meshoul, S., Batouhe, M.: Multiple Sequence Alignment by Quantum Genetic Algorithm. In: The 7th International Workshop on Parallel and Distributed Scientific and Engineering Computing of the 20th International Parallel and Distributed Processing Symposium, Greece, pp. 1\u20138 (April 2006)","DOI":"10.1109\/IPDPS.2006.1639617"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Asahiro, Y., Iwama, K., Miyano, E.: Random Generation of Test Instanzes with Controlled Attributes. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge. DIMACS Series on Discr. Math. and Theor. Comp. Sci, vol.\u00a026, pp. 377\u2013394 (1996), \n                      http:\/\/www.cs.ubc.ca\/~hoos\/SATLIB\/Benchmarks\/SAT\/DIMACS\/AIM\/descr.html","DOI":"10.1090\/dimacs\/026\/18"}],"container-title":["Lecture Notes in Computer Science","Hybrid Artificial Intelligence Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87656-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:47:44Z","timestamp":1714621664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87656-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876557","9783540876564"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87656-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}